Sciweavers

2652 search results - page 375 / 531
» When Information Improves Information Security
Sort
View
RSS
2007
198views Robotics» more  RSS 2007»
15 years 8 months ago
CRF-Matching: Conditional Random Fields for Feature-Based Scan Matching
— Matching laser range scans observed at different points in time is a crucial component of many robotics tasks, including mobile robot localization and mapping. While existing t...
Fabio T. Ramos, Dieter Fox, Hugh F. Durrant-Whyte
TON
2002
175views more  TON 2002»
15 years 6 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 6 months ago
Mining User Profiles to Support Structure and Explanation in Open Social Networking
The proliferation of media sharing and social networking websites has brought with it vast collections of site-specific user generated content. The result is a Social Networking Di...
Avare Stewart, Ernesto Diaz-Aviles, Wolfgang Nejdl
CDC
2010
IEEE
137views Control Systems» more  CDC 2010»
15 years 1 months ago
Control of large 1D networks of double integrator agents: Role of heterogeneity and asymmetry on stability margin
We consider the distributed control of a network of heterogeneous agents with double integrator dynamics to maintain a rigid formation in 1D. The control signal at a vehicle is all...
He Hao, Prabir Barooah
TOMACS
2010
79views more  TOMACS 2010»
15 years 1 months ago
A stochastic approximation method with max-norm projections and its applications to the Q-learning algorithm
In this paper, we develop a stochastic approximation method to solve a monotone estimation problem and use this method to enhance the empirical performance of the Q-learning algor...
Sumit Kunnumkal, Huseyin Topaloglu