Sciweavers

2478 search results - page 116 / 496
» Universality in two dimensions
Sort
View
ECCV
2010
Springer
15 years 11 months ago
Reweighted Random Walks for Graph Matching
Graph matching is an essential problem in computer vision and machine learning. In this paper, we introduce a random walk view on the problem and propose a robust graph matching al...
Minsu Cho (Seoul National University), Jungmin Lee...
MFCS
2001
Springer
15 years 10 months ago
The k-Median Problem for Directed Trees
Abstract Marek Chrobak1 , Lawrence L. Larmore2 , and Wojciech Rytter3,4 1 Department of Computer Science, University of California Riverside, CA 92521 2 Department of Computer Scie...
Marek Chrobak, Lawrence L. Larmore, Wojciech Rytte...
INTERSPEECH
2010
15 years 1 months ago
Hierarchical multilayer perceptron based language identification
Automatic language identification (LID) systems generally exploit acoustic knowledge, possibly enriched by explicit language specific phonotactic or lexical constraints. This pape...
David Imseng, Mathew Magimai-Doss, Hervé Bo...
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
16 years 6 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen
ICRA
2006
IEEE
130views Robotics» more  ICRA 2006»
16 years 13 days ago
Voronoi Diagram and Fast Marching applied to Path Planning
— This paper presents a new Path Planning method which operates in two steps. In the first step the safest areas in the environment are extracted by means of a Voronoi diagram. ...
Santiago Garrido, Luis Moreno, Dolores Blanco