Sciweavers

1442 search results - page 32 / 289
» Finding interesting things
Sort
View
ICRA
2003
IEEE
129views Robotics» more  ICRA 2003»
14 years 1 months ago
Optimal navigation and object finding without geometric maps or localization
In this paper we present a dynamic data structure, useful for robot navigation in an unknown, simplyconnected planar environment. The guiding philosophy in this work is to avoid t...
Benjamín Tovar, Steven M. LaValle, Rafael M...
COCOON
2003
Springer
14 years 1 months ago
Finding Hidden Independent Sets in Interval Graphs
We design efficient competitive algorithms for discovering hidden information using few queries. Specifically, consider a game in a given set of intervals (and their implied inte...
Therese C. Biedl, Brona Brejová, Erik D. De...
WEBDB
2010
Springer
172views Database» more  WEBDB 2010»
14 years 1 months ago
Find your Advisor: Robust Knowledge Gathering from the Web
We present a robust method for gathering relational facts from the Web, based on matching generalized patterns which are automatically learned from seed facts for relations of int...
Ndapandula Nakashole, Martin Theobald, Gerhard Wei...
CHI
2000
ACM
14 years 26 days ago
DENIM: finding a tighter fit between tools and practice for Web site design
Through a study of web site design practice, we observed that web site designers design sites at different levels of refinement—site map, storyboard, and individual page— and ...
James Lin, Mark W. Newman, Jason I. Hong, James A....
WG
1999
Springer
14 years 23 days ago
Finding Smallest Supertrees Under Minor Containment
The diversity of application areas relying on tree-structured data results in wide interest in algorithms which determine differences or similarities among trees. One way of meas...
Naomi Nishimura, Prabhakar Ragde, Dimitrios M. Thi...