Sciweavers

6455 search results - page 324 / 1291
» Research problems
Sort
View
ICRA
2008
IEEE
160views Robotics» more  ICRA 2008»
16 years 1 months ago
Probabilistic localization with a blind robot
Abstract— Researchers have addressed the localization problem for mobile robots using many different kinds of sensors, including rangefinders, cameras, and odometers. In this pa...
Lawrence H. Erickson, Joseph Knuth, Jason M. O'Kan...
SYNASC
2008
IEEE
284views Algorithms» more  SYNASC 2008»
16 years 1 months ago
Graph Rewriting in Computational Origami
We formalize paper fold (origami) by graph rewriting. Origami tion is abstractly described by a rewrite system (O, ), where set of abstract origami’s and is a binary relation on ...
Tetsuo Ida
LCN
2006
IEEE
16 years 21 days ago
Sensor Networks Routing via Bayesian Exploration
There is increasing research interest in solving routing problems in sensor networks subject to constraints such as data correlation, link reliability and energy conservation. Sin...
Shuang Hao, Ting Wang
DEXA
2009
Springer
172views Database» more  DEXA 2009»
15 years 10 months ago
Utilizing XML Clustering for Efficient XML Data Management on P2P Networks
Peer-to-Peer (P2P) data integration combines the P2P infrastructure with traditional scheme-based data integration techniques. Some of the primary problems in this research area ar...
Panagiotis Antonellis, Christos Makris, Nikos Tsir...
NIPS
2007
15 years 8 months ago
Supervised Topic Models
We introduce supervised latent Dirichlet allocation (sLDA), a statistical model of labelled documents. The model accommodates a variety of response types. We derive a maximum-like...
David M. Blei, Jon D. McAuliffe