9842 search results - page 1442 / 1969 » The Complexity of the Matching-Cut Problem |
217
click to vote
CVPR
2010
IEEE
16 years 3 months ago
2010
IEEE
We present a method for detecting and parsing buildings from unorganized 3D point clouds into a compact, hierarchical representation that is useful for high-level tasks. The input...
183
click to vote
ICPR
2010
IEEE
16 years 2 months ago
2010
IEEE
GMM based algorithms have become the de facto standard for background subtraction in video sequences, mainly because of their ability to track multiple background distributions, w...
180
click to vote
WWW
2010
ACM
16 years 2 months ago
2010
ACM
Breakpoints are perhaps the quintessential feature of a debugger: they allow a developer to stop time and study the program state. Breakpoints are typically specified by selectin...
160
click to vote
CHI
2010
ACM
16 years 1 months ago
2010
ACM
Theoretical accounts of task resumption after interruption have almost exclusively argued for resumption as a primarily memory-based process. In contrast, for many task domains, r...
180
click to vote
EVOW
2009
Springer
16 years 1 months ago
2009
Springer
In this paper we propose a new tabu search hyperheuristic which makes individual low level heuristics tabu dynamically using an analogy with the Binary Exponential Back Off (BEBO) ...