2272 search results - page 178 / 455 » Capture Complexity by Partition |
111
Voted
TALG
2010
15 years 1 months ago
2010
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...
164
Voted
MOBISYS
2011
ACM
14 years 6 months ago
2011
ACM
Resource constrained mobile devices need to leverage computation on nearby servers to run responsive applications that recognize objects, people, or gestures from real-time video....
193
Voted
CVPR
2009
IEEE
16 years 10 months ago
2009
IEEE
In this paper, we present a new framework of video object
segmentation, in which we formulate the task of extracting
prominent objects from a scene as the problem of hypergraph
...
133
click to vote
ICCV
2005
IEEE
16 years 5 months ago
2005
IEEE
This paper introduces a simple and efficient representation for natural images. We partition an image into blocks and treat the blocks as vectors in a high-dimensional space. We t...
207
Voted
ICDE
1999
IEEE
16 years 4 months ago
1999
IEEE
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...