4926 search results - page 354 / 986 » Two Graph Algorithms On an Associative Computing Model |
107
click to vote
IROS
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper formalizes and proposes an algorithm to compute coverage diameters of polygons in 2D. Roughly speaking, the coverage diameter of a polygon is the longest possible di...
181
Voted
PDCAT
2005
Springer
15 years 10 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
185
click to vote
AIME
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. The prediction of diagnosis codes is typically based on freetext entries in clinical documents. Previous attempts to tackle this problem range from strictly rule-based sy...
126
click to vote
ICNP
2005
IEEE
15 years 10 months ago
2005
IEEE
Position-based routing protocols in ad hoc networks combine a forwarding strategy with a recovery algorithm. The former fails when there are void regions or physical obstacles tha...
125
click to vote
CVPR
2000
IEEE
15 years 9 months ago
2000
IEEE
We present a novel approach for learning patterns (sub-images) shared by multiple images without prior knowledge about the number and the positions of the patterns in the images. ...