Sciweavers

1388 search results - page 143 / 278
» Approximability of Robust Network Design
Sort
View
135
Voted
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
15 years 4 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...
153
Voted
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 6 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...
147
Voted
WOWMOM
2009
ACM
146views Multimedia» more  WOWMOM 2009»
15 years 10 months ago
When opportunity proceeds from autonomy: A tour-based architecture for disconnected mobile sensors
We consider the case of sparse mobile sensors deployed to implement missions in challenging environments. This paper explores a notion of tour networks that is well suited to circ...
Michel Charpentier, Radim Bartos, Swapnil Bhatia
152
Voted
TMC
2010
224views more  TMC 2010»
15 years 1 months ago
Multihop Range-Free Localization in Anisotropic Wireless Sensor Networks: A Pattern-Driven Scheme
—This paper focuses on multihop range-free localization in anisotropic wireless sensor networks. In anisotropic networks, geometric distance between a pair of sensor nodes is not...
Qingjun Xiao, Bin Xiao, Jiannong Cao, Jianping Wan...
115
Voted
ICNP
2007
IEEE
15 years 9 months ago
A Probabilistic Coverage Protocol for Wireless Sensor Networks
—We propose a new probabilistic coverage protocol (denoted by PCP) that considers probabilistic sensing models. PCP is fairly general and can be used with different sensing model...
Mohamed Hefeeda, Hossein Ahmadi