Sciweavers

117 search results - page 21 / 24
» What do we know about the Metropolis algorithm
Sort
View
AAECC
2001
Springer
132views Algorithms» more  AAECC 2001»
13 years 12 months ago
Duality and Greedy Weights of Linear Codes and Projective Multisets
A projective multiset is a collection of projective points, which are not necessarily distinct. A linear code can be represented as a projective multiset, by taking the columns of ...
Hans Georg Schaathun
HRI
2006
ACM
14 years 1 months ago
FOCUS: a generalized method for object discovery for robots that observe and interact with humans
The essence of the signal-to-symbol problem consists of associating a symbolic description of an object (e.g., a chair) to a signal (e.g., an image) that captures the real object....
Manuela M. Veloso, Paul E. Rybski, Felix von Hunde...
AAAI
2007
13 years 9 months ago
Automated Online Mechanism Design and Prophet Inequalities
Recent work on online auctions for digital goods has explored the role of optimal stopping theory — particularly secretary problems — in the design of approximately optimal on...
Mohammad Taghi Hajiaghayi, Robert D. Kleinberg, Tu...
PVLDB
2010
159views more  PVLDB 2010»
13 years 5 months ago
Explore or Exploit? Effective Strategies for Disambiguating Large Databases
Data ambiguity is inherent in applications such as data integration, location-based services, and sensor monitoring. In many situations, it is possible to “clean”, or remove, ...
Reynold Cheng, Eric Lo, Xuan Yang, Ming-Hay Luk, X...
TASE
2010
IEEE
13 years 2 months ago
Robust Calibration for Localization in Clustered Wireless Sensor Networks
This paper presents a robust calibration procedure for clustered wireless sensor networks. Accurate calibration of between-node distances is one crucial step in localizing sensor n...
Jung Jin Cho, Yu Ding, Yong Chen, Jiong Tang