Sciweavers

614 search results - page 114 / 123
» Local Computation: Lower and Upper Bounds
Sort
View
ICDE
2006
IEEE
160views Database» more  ICDE 2006»
14 years 8 months ago
Surface k-NN Query Processing
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu 0003...
TACAS
2010
Springer
241views Algorithms» more  TACAS 2010»
14 years 2 months ago
Arrival Curves for Real-Time Calculus: The Causality Problem and Its Solutions
Abstract. The Real-Time Calculus (RTC) [16] is a framework to analyze heterogeneous real-time systems that process event streams of data. The streams are characterized by pairs of ...
Matthieu Moy, Karine Altisen
FOCS
2009
IEEE
14 years 2 months ago
Choice-Memory Tradeoff in Allocations
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich
EMSOFT
2007
Springer
14 years 1 months ago
Methods for multi-dimensional robustness optimization in complex embedded systems
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
Arne Hamann, Razvan Racu, Rolf Ernst
WSNA
2003
ACM
14 years 18 days ago
Analysis on the redundancy of wireless sensor networks
Wireless sensor networks consist of a large number of tiny sensors that have only limited energy supply. One of the major challenges in constructing such networks is to maintain l...
Yong Gao, Kui Wu, Fulu Li