Sciweavers

4797 search results - page 277 / 960
» The complexity of partition tasks
Sort
View
MOBISYS
2011
ACM
14 years 9 months ago
Odessa: enabling interactive perception applications on mobile devices
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....
Moo-Ryong Ra, Anmol Sheth, Lily B. Mummert, Padman...
ICCV
2005
IEEE
16 years 8 months ago
A Multi-Scale Hybrid Linear Model for Lossy Image Representation
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...
Wei Hong, John Wright, Kun Huang, Yi Ma
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
16 years 8 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
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...
Volker Markl, Martin Zirkel, Rudolf Bayer
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
16 years 1 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
DEBS
2009
ACM
16 years 1 months ago
Distributed event stream processing with non-deterministic finite automata
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
Lars Brenna, Johannes Gehrke, Mingsheng Hong, Dag ...