Sciweavers

2925 search results - page 120 / 585
» Information Complexity of Online Problems
Sort
View
ICRA
2007
IEEE
122views Robotics» more  ICRA 2007»
16 years 22 days ago
Exploiting the Information at the Loop Closure in SLAM
— This paper presents two methods able to exploit the information at the loop closure in the SLAM problem. Both methods have three fundamental advantages. The first one is that ...
Agostino Martinelli, Roland Siegwart
IAT
2007
IEEE
16 years 23 days ago
TIBOR: A Resource-bounded Information Foraging Agent for Visual Analytics
Visual Analytics is the science of applying reasoning and analysis techniques to large, complex real-world data for problem solving using visualizations. Real world knowledge gath...
Dingxiang Liu, Anita Raja, Jayasri Vaidyanath
SIAMCO
2010
147views more  SIAMCO 2010»
15 years 4 months ago
Anytime Reliable Transmission of Real-Valued Information through Digital Noisy Channels
Abstract. The problem of reliably transmitting a real-valued random vector through a digital noisy channel is relevant for the design of distributed estimation and control techniqu...
Giacomo Como, Fabio Fagnani, Sandro Zampieri
ARCS
2006
Springer
15 years 10 months ago
Power-Aware Collective Tree Exploration
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
Miroslaw Dynia, Miroslaw Korzeniowski, Christian S...
WWW
2007
ACM
16 years 7 months ago
Netprobe: a fast and scalable system for fraud detection in online auction networks
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...
Shashank Pandit, Duen Horng Chau, Samuel Wang, Chr...