Sciweavers

5592 search results - page 1005 / 1119
» On Random Betweenness Constraints
Sort
View
164
Voted
EDBT
2010
ACM
246views Database» more  EDBT 2010»
15 years 11 months ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...
138
Voted
STACS
2009
Springer
15 years 11 months ago
Economical Caching
Abstract. We study the management of buffers and storages in environments with unpredictably varying prices in a competitive analysis. In the economical caching problem, there is ...
Matthias Englert, Heiko Röglin, Jacob Spö...
IAT
2009
IEEE
15 years 11 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
SISAP
2009
IEEE
149views Data Mining» more  SISAP 2009»
15 years 11 months ago
Combinatorial Framework for Similarity Search
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
Yury Lifshits
INFOCOM
2009
IEEE
15 years 11 months ago
Trap Coverage: Allowing Coverage Holes of Bounded Diameter in Wireless Sensor Networks
—Tracking of movements such as that of people, animals, vehicles, or of phenomena such as fire, can be achieved by deploying a wireless sensor network. So far only prototype sys...
Paul Balister, Zizhan Zheng, Santosh Kumar, Prasun...
« Prev « First page 1005 / 1119 Last » Next »