Sciweavers

15351 search results - page 3026 / 3071
» The information bottleneck method
Sort
View
IJRR
2008
92views more  IJRR 2008»
13 years 7 months ago
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
We propose a new `Mark-Ant-Walk' algorithm for robust and efficient covering of continuous domains by ant-like robots with very limited capabilities. The robots can mark plac...
Eliyahu Osherovich, Vladimir Yanovski, Israel A. W...
IJSN
2008
145views more  IJSN 2008»
13 years 7 months ago
Clique-based group key assignment in Wireless Sensor Networks
: Security has become the corner stone of research in wireless sensor networks (WSNs). Due to the unique operational environment of WSNs, where the communication medium is open to ...
Avinash Srinivasan, Feng Li, Jie Wu, Minglu Li
CN
2007
91views more  CN 2007»
13 years 7 months ago
On investigating overlay service topologies
Recently, a moderate amount of work has been reported on the use of overlay networks to support value-added network services, such as multicasting, Quality of Service (QoS), secur...
Zhi Li, Prasant Mohapatra
IJDAR
2006
245views more  IJDAR 2006»
13 years 7 months ago
Object count/area graphs for the evaluation of object detection and segmentation algorithms
Evaluation of object detection algorithms is a non-trivial task: a detection result is usually evaluated by comparing the bounding box of the detected object with the bounding box...
Christian Wolf, Jean-Michel Jolion
ISI
2008
Springer
13 years 7 months ago
Probabilistic frameworks for privacy-aware data mining
Often several cooperating parties would like to have a global view of their joint data for various data mining objectives, but cannot reveal the contents of individual records due...
Joydeep Ghosh
« Prev « First page 3026 / 3071 Last » Next »