首页
学习
活动
专区
圈层
工具
发布
    • 综合排序
    • 最热优先
    • 最新优先
    时间不限
  • 来自专栏码匠的流水账

    聊聊flink的Sliding Window

    序 本文主要研究一下flink的Sliding Window SlidingEventTimeWindows flink-streaming-java_2.11-1.7.0-sources.jar! of静态工厂方法,可以指定size、slide及offset参数,它对于传入的offset参数转为毫秒然后与slide.toMilliseconds()取余作为最后的offset值 小结 flink的Sliding getDefaultTrigger返回的是EventTimeTrigger,而后者返回的是ProcessingTimeTrigger;前者isEventTime方法返回的为true,而后者返回的为false doc Sliding

    1K30发布于 2019-01-23
  • 来自专栏Some studies in imgs

    Search for the filling range based on the sliding window

    Sliding search in the X direction (the brown area)3. Within the brown area, perform a sliding search in the Y direction (the yellow area)4.

    11910编辑于 2025-10-17
  • 来自专栏XINDOO的专栏

    poj 2823 Sliding Window

    让你设计一个队列,是其求里面最大值的时间复杂度尽可能的低,但这个队列除了最大值外,就是一个普通的队列,该怎么进出还是怎么进出,并不是优先队列。

    41310发布于 2021-01-21
  • 来自专栏LeetCode

    239.Sliding Window Maximum

    一、239.Sliding Window Maximum Given an array nums, there is a sliding window of size k which is moving Each time the sliding window moves right by one position. Return the max sliding window.

    73500发布于 2019-02-24
  • 来自专栏皮皮星球

    Sliding Window Maximum

    Sliding Window Maximum Given an array nums, there is a sliding window of size k which is moving from Each time the sliding window moves right by one position. Return the max sliding window.

    39510发布于 2020-09-23
  • 来自专栏Reck Zhang

    LeetCode 0239 - Sliding Window Maximum

    Sliding Window Maximum Desicription Given an array nums, there is a sliding window of size k which is Each time the sliding window moves right by one position. Return the max sliding window.

    28510发布于 2021-08-11
  • 来自专栏码匠的流水账

    聊聊flink的Sliding Window

    序 本文主要研究一下flink的Sliding Window Screen-Shot-2016-05-06-at-16.44.38-700x361.png SlidingEventTimeWindows of静态工厂方法,可以指定size、slide及offset参数,它对于传入的offset参数转为毫秒然后与slide.toMilliseconds()取余作为最后的offset值 小结 flink的Sliding getDefaultTrigger返回的是EventTimeTrigger,而后者返回的是ProcessingTimeTrigger;前者isEventTime方法返回的为true,而后者返回的为false doc Sliding

    1.7K50发布于 2019-01-03
  • 来自专栏皮皮星球

    Sliding Window - 76. Minimum Window Substring

    思路: 这是一道经典的sliding window的题目,题目意思是给定两个字符串,字符串S如果包含另一个字符串T的所有字符,那么就返回这个包含T所有字符的最小字符串。

    1.4K10发布于 2020-09-23
  • 来自专栏眯眯眼猫头鹰的小树杈

    Sliding Window Median

    Examples: [2,3,4] , the median is 3 [2,3], the median is (2 + 3) / 2 = 2.5 Given an array nums, there is a sliding Each time the sliding window moves right by one position. 3 1 3 -1 -3 [5 3 6] 7 5 1 3 -1 -3 5 [3 6 7] 6 Therefore, return the median sliding

    49920发布于 2020-05-11
  • 来自专栏机器学习入门

    Sliding Puzzle

    Sliding Puzzle 传送门:773. Sliding Puzzle Problem: On a 2x3 board, there are 5 tiles represented by the integers 1 through 5, and

    40130发布于 2019-05-26
  • 来自专栏小鹏的专栏

    Faster RCNN:RPN,anchor,sliding windows

    paper链接:Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networks Github源码pyth

    2.7K100发布于 2018-01-09
  • 来自专栏计算机视觉与深度学习基础

    Sliding Window Maximum

    Given an array nums, there is a sliding window of size k which is moving from the very left of the array Each time the sliding window moves right by one position. 5 1 3 -1 -3 [5 3 6] 7 6 1 3 -1 -3 5 [3 6 7] 7 Therefore, return the max sliding

    62450发布于 2018-01-12
  • 来自专栏掘金安东尼

    温故知新 —— Sliding Window

    [5, 7, 1, 4, 3] 是第一组 5 个连续元素,求和是 20,[7, 1, 4, 3, 6] 是第二组 5 个连续元素,求和是 21......这样一直进行下去,最终对比发现 5 个连续元素的最大和是 24,由 [4, 3, 6, 2, 9] 组成;

    42720编辑于 2022-09-19
  • 来自专栏JNing的专栏

    深度学习: sliding window (滑动窗口)

    Introduce sliding window (滑动窗口) 在深度学习中得到了极其广泛的运用。从卷积层到池化层,都能看见它的身影。

    4.7K30发布于 2018-09-27
  • 来自专栏饶文津的专栏

    【POJ 2823】Sliding Window(单调队列堆)

    单调队列或堆。 入队的条件是当前的进入了滑窗范围。 出队的条件是当前不在滑窗范围。

    30310发布于 2020-06-02
  • 来自专栏算法修养

    Sliding Window Maximum(Hard)

    题意:在一个固定长度的滑动窗口里,计算窗口里的最大值,并且这个滑动窗口每次移动一个。

    39820发布于 2020-03-06
  • 来自专栏MiningAlgorithms

    Data Structures and Algorithms Basics(014):Sliding Window

    Sliding Window 目录: 1,删除重复元素 2,删除后,重复值不超过两个 3,删除元素 4,最大均值子数组 5,最长连续递增子序列 6,最短子数组之和 7,实现strStr()函数 8,子数组乘积小于 char_dict[char] = char_dict.get(char, 0) + 1 # track count of chars # decrease the size of sliding window until you have k unique chars in sliding window while len(char_dict) > k:

    49820发布于 2019-08-08
  • 来自专栏皮皮星球

    Sliding Window - 395. Longest Substring with At Least K Repeating Characters

    395. Longest Substring with At Least K Repeating Characters

    60010发布于 2020-09-23
  • 来自专栏皮皮星球

    Sliding Window - 30. Substring with Concatenation of All Words

    30. Substring with Concatenation of All Words

    40520发布于 2020-09-23
  • 来自专栏方亮

    0基础学习PyFlink——个数滑动窗口(Sliding Count Windows)

    滑动(Sliding)和滚动(Tumbling)的区别 正如其名,“滑动”是指这个窗口沿着一定的方向,按着一定的速度“滑行”。 # reducing windows_size = 2 sliding_size = 1 reduced=keyed.count_window(windows_size, sliding_size = 1 reduced=keyed.count_window(windows_size, sliding_size) \ .apply(SumWindowFunction = 2 reduced=keyed.count_window(windows_size, sliding_size) \ .apply(SumWindowFunction # reducing windows_size = 3 sliding_size = 3 reduced=keyed.count_window(windows_size, sliding_size

    48120编辑于 2023-11-01
领券