Sciweavers

315 search results - page 20 / 63
» Algebraic Lower Bounds for Computing on Encrypted Data
Sort
View
CISS
2008
IEEE
15 years 4 months ago
A distributed scheme for detection of information flows
—Distributed detection of information flows spanning many nodes in a wireless sensor network is considered. In such a system, eavesdroppers are deployed near several nodes in th...
Ameya Agaskar, Lang Tong, Ting He
AAAI
1990
14 years 10 months ago
Obtaining Quantitative Predictions from Monotone Relationships
: Tasks such as forecasting, diagnosis, and planning frequently require quantitative predictions . Typically, quantitative predictions are obtained by characterizing a system in te...
Joseph L. Hellerstein
INFOCOM
2010
IEEE
14 years 7 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
IJNSEC
2008
164views more  IJNSEC 2008»
14 years 9 months ago
Secure Real-Time Streaming Protocol (RTSP) for Hierarchical Proxy Caching
Proxies are commonly used to cache objects, especially multimedia objects, so that clients can enjoy better quality-of-service (QoS) guarantees such as smaller startup latency and...
Yeung Siu Fung, John C. S. Lui, David K. Y. Yau
CIAC
2006
Springer
278views Algorithms» more  CIAC 2006»
15 years 1 months ago
Covering a Set of Points with a Minimum Number of Lines
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
Magdalene Grantson, Christos Levcopoulos