Sciweavers

616 search results - page 103 / 124
» Local Feature Matching Using Entropic Graphs
Sort
View
ICALP
2001
Springer
14 years 10 days ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
IAT
2008
IEEE
14 years 2 months ago
Exploiting Hyponymy in Extracting Relations and Enhancing Ontologies
Relation extraction systems typically rely on local lexical and syntactic features as evidence. Recent work suggests that for a given relation, there might exist certain patterns ...
Bhushan Mandhani, Stephen Soderland
ICRA
2006
IEEE
198views Robotics» more  ICRA 2006»
14 years 1 months ago
3D Navigation based on a Visual Memory
— This paper addresses the design of a control law for vision-based robot navigation. The method proposed is based on a topological representation of the environment. Within this...
Anthony Remazeilles, François Chaumette, Pa...
MOBIHOC
2008
ACM
14 years 7 months ago
Using persistent homology to recover spatial information from encounter traces
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...
Brenton D. Walker
VISUALIZATION
2000
IEEE
14 years 7 days ago
Volume illustration: non-photorealistic rendering of volume models
Accurately and automatically conveying the structure of a volume model is a problem not fully solved by existing volume rendering approaches. Physics-based volume rendering approa...
David S. Ebert, Penny Rheingans