Sciweavers

7106 search results - page 886 / 1422
» Restricted Complexity, General Complexity
Sort
View
INFOCOM
2011
IEEE
14 years 10 months ago
Finite-horizon energy allocation and routing scheme in rechargeable sensor networks
Abstract—In this paper, we investigate the problem of maximizing the throughput over a finite-horizon time period for a sensor network with energy replenishment. The finite-horiz...
Shengbo Chen, Prasun Sinha, Ness B. Shroff, Changh...
MOBISYS
2011
ACM
14 years 10 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...
PODS
2011
ACM
238views Database» more  PODS 2011»
14 years 10 months ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 10 months ago
FlexMin: a flexible tool for automatic bug isolation in DBMS software
Debugging a database engine is an arduous task due to the complexity of the query workloads and systems. The first step in isolating a bug involves identifying a sequence of step...
Kristi Morton, Nicolas Bruno
APPROX
2011
Springer
234views Algorithms» more  APPROX 2011»
14 years 7 months ago
Streaming Algorithms with One-Sided Estimation
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
Joshua Brody, David P. Woodruff