5595 search results - page 169 / 1119 » Approximation Algorithms for Clustering Problems |
115
Voted
AAAI
2008
15 years 7 months ago
2008
Compilation is an important approach to a range of inference problems, since it enables linear-time inference in the size S of the compiled representation. However, the main drawb...
128
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...
141
click to vote
SAC
2006
ACM
15 years 11 months ago
2006
ACM
We consider the problem of partitioning, in a highly accurate and highly efficient way, a set of n documents lying in a metric space into k non-overlapping clusters. We augment th...
136
click to vote
ASPDAC
2007
ACM
15 years 9 months ago
2007
ACM
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...
162
Voted
CORR
2007
Springer
15 years 5 months ago
2007
Springer
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to ...