Sciweavers

297 search results - page 56 / 60
» Polynomial heuristics for query optimization
Sort
View
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 9 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...
BMCBI
2011
12 years 11 months ago
Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
Torbjørn Rognes
ECOOP
2004
Springer
14 years 1 months ago
Finding and Removing Performance Bottlenecks in Large Systems
Abstract. Software systems obey the 80/20 rule: aggressively optimizing a vital few execution paths yields large speedups. However, finding the vital few paths can be difficult, e...
Glenn Ammons, Jong-Deok Choi, Manish Gupta, Nikhil...
ICCAD
2009
IEEE
161views Hardware» more  ICCAD 2009»
13 years 5 months ago
The epsilon-approximation to discrete VT assignment for leakage power minimization
As VLSI technology reaches 45nm technology node, leakage power optimization has become a major design challenge. Threshold voltage (vt) assignment has been extensively studied, du...
Yujia Feng, Shiyan Hu
MIDDLEWARE
2007
Springer
14 years 1 months ago
A piggybacking approach to reduce overhead in sensor network gossiping
Many wireless sensor network protocols are employing gossipbased message dissemination, where nodes probabilistically forward messages, to reduce message overhead. We are concerne...
Ercan Ucan, Nathanael Thompson, Indranil Gupta