3020 search results - page 590 / 604 » Optimal partition trees |
187
click to vote
MOBIHOC
2007
ACM
16 years 3 months ago
2007
ACM
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
136
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
123
click to vote
ICCAD
2001
IEEE
16 years 22 days ago
2001
IEEE
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
136
click to vote
ICDE
2009
IEEE
15 years 10 months ago
2009
IEEE
— We present SMART, a self-tuning, bandwidth-aware monitoring system that maximizes result precision of continuous aggregate queries over dynamic data streams. While prior approa...
135
Voted
PLDI
2009
ACM
15 years 10 months ago
2009
ACM
Transactional memory (TM) is an appealing abstraction for programming multi-core systems. Potential target applications for TM, such as business software and video games, are like...