Sciweavers

683 search results - page 94 / 137
» Randomized Data Structures for the Dynamic Closest-Pair Prob...
Sort
View
CDC
2008
IEEE
102views Control Systems» more  CDC 2008»
13 years 9 months ago
Search decisions for teams of automata
Abstract-- The dynamics of exploration vs exploitation decisions are explored in the context of robotic search problems. Building on prior work on robotic search together with our ...
Dimitar Baronov, John Baillieul
CACM
1998
110views more  CACM 1998»
13 years 7 months ago
Viewing WISs as Database Applications
abstraction for modeling these problems is to view the Web as a collection of (usually small and heterogeneous) databases, and to view programs that extract and process Web data au...
Gustavo O. Arocena, Alberto O. Mendelzon
ICML
2009
IEEE
14 years 8 months ago
Unsupervised hierarchical modeling of locomotion styles
This paper describes an unsupervised learning technique for modeling human locomotion styles, such as distinct related activities (e.g. running and striding) or variations of the ...
Wei Pan, Lorenzo Torresani
JGAA
2007
135views more  JGAA 2007»
13 years 7 months ago
Challenging Complexity of Maximum Common Subgraph Detection Algorithms: A Performance Analysis of Three Algorithms on a Wide Dat
Graphs are an extremely general and powerful data structure. In pattern recognition and computer vision, graphs are used to represent patterns to be recognized or classified. Det...
Donatello Conte, Pasquale Foggia, Mario Vento
TAPSOFT
1993
Springer
13 years 12 months ago
Exception Handling and Term Labelling
: We propose a new algebraic framework for exception handling which is powerful enough to cope with many exception handling features such that recovery, implicit propagation of exc...
Gilles Bernot, Pascale Le Gall