Sciweavers

5105 search results - page 309 / 1021
» An algorithm to determine peer-reviewers
Sort
View
177
Voted
ADHOC
2006
113views more  ADHOC 2006»
15 years 6 months ago
Positioning using local maps
ct 9 It is often useful to know the positions of nodes in a network. However, in a large network it is impractical to build a 10 single global map. In this paper, we present a new ...
Yi Shang, Wheeler Ruml, Markus P. J. Fromherz
JSAC
2006
183views more  JSAC 2006»
15 years 6 months ago
HiRLoc: high-resolution robust localization for wireless sensor networks
In this paper we address the problem of robustly estimating the position of randomly deployed nodes of a Wireless Sensor Network (WSN), in the presence of security threats. We prop...
Loukas Lazos, Radha Poovendran
KAIS
2006
97views more  KAIS 2006»
15 years 6 months ago
Web image indexing by using associated texts
In order to index Web images, the whole associated texts are partitioned into a sequence of text blocks, then the local relevance of a term to the corresponding image is calculated...
Zhiguo Gong, Leong Hou U, Chan Wa Cheang
PR
2006
80views more  PR 2006»
15 years 6 months ago
Neighborhood size selection in the k-nearest-neighbor rule using statistical confidence
The k-nearest-neighbor rule is one of the most attractive pattern classification algorithms. In practice, the choice of k is determined by the cross-validation method. In this wor...
Jigang Wang, Predrag Neskovic, Leon N. Cooper
JACM
2007
121views more  JACM 2007»
15 years 6 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...