279 search results - page 25 / 56 » Reduction approaches for robust shortest path problems |
TIP
1998
14 years 9 months ago
1998
—In this paper, we present fast and efficient methods for the lossy encoding of object boundaries that are given as eight-connect chain codes. We approximate the boundary by a p...
79
Voted
ICCAD
2000
IEEE
15 years 2 months ago
2000
IEEE
— Sub-micron feature sizes have resulted in a considerable portion of power to be dissipated on the buses, causing an increased attention on savings for power at the behavioral l...
176
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to effici...
85
Voted
RECOMB
2001
Springer
15 years 10 months ago
2001
Springer
For the last twenty years fragment assembly in DNA sequencing followed the "overlap - layout - consensus" paradigm that is used in all currently available assembly tools...
GIS
2009
ACM
15 years 2 months ago
2009
ACM
This paper looks at the problem of data prioritization, commonly found in mobile ad-hoc networks. The proposed general solution uses a machine learning approach in order to learn ...