Sciweavers

4560 search results - page 79 / 912
» Finding Data in the Neighborhood
Sort
View
ICRA
2009
IEEE
103views Robotics» more  ICRA 2009»
14 years 2 months ago
Finding good cycle constraints for large scale multi-robot SLAM
Abstract— In this paper we describe an algorithm to compute cycle constraints that can be used in many graph-based SLAM algorithms; we exemplify it in Hierarchical SLAM. Our algo...
Carlos Estrada, José Neira, Juan D. Tard&oa...
FMCAD
2009
Springer
14 years 2 months ago
Finding heap-bounds for hardware synthesis
Abstract—Dynamically allocated and manipulated data structures cannot be translated into hardware unless there is an upper bound on the amount of memory the program uses during a...
Byron Cook, Ashutosh Gupta, Stephen Magill, Andrey...
FQAS
2009
Springer
127views Database» more  FQAS 2009»
14 years 2 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...
MDM
2009
Springer
116views Communications» more  MDM 2009»
14 years 2 months ago
Finding Probabilistic Nearest Neighbors for Query Objects with Imprecise Locations
—A nearest neighbor query is an important notion in spatial databases and moving object databases. In the emerging application fields of moving object technologies, such as mobi...
Yuichi Iijima, Yoshiharu Ishikawa
HICSS
2007
IEEE
145views Biometrics» more  HICSS 2007»
14 years 2 months ago
How Do Doctors Perceive the Organizing Vision for Electronic Medical Records? Preliminary Findings from a Study of EMR Adoption
Although there is an increasing emphasis on and investment in healthcare information technology (HIT) actual adoption and usage rates are below expectations. This research explore...
John Lee Reardon, Elizabeth Davidson