7006 search results - page 229 / 1402 » Approximation Algorithms |
114
click to vote
SIAMDM
2008
15 years 3 months ago
2008
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of k edge-disjoint spanning trees in an undirected graph. A corollary o...
142
Voted
ICCV
1995
IEEE
15 years 7 months ago
1995
IEEE
Estimating principal curvatures and principal directions of a surface from a polyhedral approximation with a large number of small faces, such as those produced by iso-surface con...
350
Voted
ICDE
2000
IEEE
16 years 4 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
129
Voted
DSD
2008
IEEE
15 years 5 months ago
2008
IEEE
The aim of this work is to present a method for rounding quadratically converging algorithms that improves their performance. This method is able to reduce significantly the numbe...
131
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are une...