Sciweavers

765 search results - page 95 / 153
» Empirical Design of Geometric Algorithms
Sort
View
ICML
2007
IEEE
16 years 19 days ago
Efficient inference with cardinality-based clique potentials
Many collective labeling tasks require inference on graphical models where the clique potentials depend only on the number of nodes that get a particular label. We design efficien...
Rahul Gupta, Ajit A. Diwan, Sunita Sarawagi
CHI
2005
ACM
16 years 6 days ago
An experiment in discovering personally meaningful places from location data
As mobile devices become location-aware, they offer the promise of powerful new applications. While computers work with physical locations like latitude and longitude, people thin...
Changqing Zhou, Pamela J. Ludford, Dan Frankowski,...
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
16 years 1 days ago
Extending autocompletion to tolerate errors
Autocompletion is a useful feature when a user is doing a look up from a table of records. With every letter being typed, autocompletion displays strings that are present in the t...
Surajit Chaudhuri, Raghav Kaushik
ICRA
2009
IEEE
134views Robotics» more  ICRA 2009»
15 years 6 months ago
Combining search and action for mobile robots
— We explore the interconnection between search and action in the context of mobile robotics. The task of searching for an object and then performing some action with that object...
Geoffrey Hollinger, Dave Ferguson, Siddhartha Srin...
CIKM
2009
Springer
15 years 6 months ago
Learning to rank graphs for online similar graph search
Many applications in structure matching require the ability to search for graphs that are similar to a query graph, i.e., similarity graph queries. Prior works, especially in chem...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles