Sciweavers

955 search results - page 136 / 191
» Cover Set Problem in Directional Sensor Networks
Sort
View
AAAI
2007
15 years 2 days ago
Near-optimal Observation Selection using Submodular Functions
AI problems such as autonomous robotic exploration, automatic diagnosis and activity recognition have in common the need for choosing among a set of informative but possibly expen...
Andreas Krause, Carlos Guestrin
CORR
2011
Springer
243views Education» more  CORR 2011»
14 years 4 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
INFOCOM
2000
IEEE
15 years 2 months ago
Energy Conserving Routing in Wireless Ad-hoc Networks
— An ad-hoc network of wireless static nodes is considered as it arises in a rapidly deployed, sensor based, monitoring system. Information is generated in certain nodes and need...
Jae-Hwan Chang, Leandros Tassiulas
ICCV
2009
IEEE
16 years 2 months ago
TagProp: Discriminative Metric Learning in Nearest Neighbor Models for Image Auto-Annotation
Image auto-annotation is an important open problem in computer vision. For this task we propose TagProp, a discriminatively trained nearest neighbor model. Tags of test images a...
Matthieu Guillaumin, Thomas Mensink, Jakob Verbeek...
IPPS
1997
IEEE
15 years 1 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen