Sciweavers

1429 search results - page 46 / 286
» The Complexity of the Approximation of the Bandwidth Problem
Sort
View
ICDE
2004
IEEE
140views Database» more  ICDE 2004»
14 years 9 months ago
Approximate Aggregation Techniques for Sensor Databases
In the emerging area of sensor-based systems, a significant challenge is to develop scalable, fault-tolerant methods to extract useful information from the data the sensors collec...
Jeffrey Considine, Feifei Li, George Kollios, John...
JMLR
2006
117views more  JMLR 2006»
13 years 7 months ago
On the Complexity of Learning Lexicographic Strategies
Fast and frugal heuristics are well studied models of bounded rationality. Psychological research has proposed the take-the-best heuristic as a successful strategy in decision mak...
Michael Schmitt, Laura Martignon
IPSN
2007
Springer
14 years 1 months ago
Energy-optimized image communication on resource-constrained sensor platforms
Energy-efficient image communication is one of the most important goals for a large class of current and future sensor network applications. This paper presents a quantitative com...
Dong-U Lee, Hyungjin Kim, Steven Tu, Mohammad H. R...
SIGGRAPH
1996
ACM
13 years 11 months ago
Progressive Meshes
Highly detailed geometric models are rapidly becoming commonplace in computer graphics. These models, often represented as complex triangle meshes, challenge rendering performance...
Hugues Hoppe
ICDE
2011
IEEE
274views Database» more  ICDE 2011»
12 years 11 months ago
SQPR: Stream query planning with reuse
—When users submit new queries to a distributed stream processing system (DSPS), a query planner must allocate physical resources, such as CPU cores, memory and network bandwidth...
Evangelia Kalyvianaki, Wolfram Wiesemann, Quang Hi...