2168 search results - page 241 / 434 » Randomized Algorithms and Complexity Theory |
189
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
144
click to vote
DAC
2004
ACM
16 years 4 months ago
2004
ACM
Current technology trends have led to the growing impact of both inter-die and intra-die process variations on circuit performance. While it is imperative to model parameter varia...
169
Voted
KDD
2007
ACM
16 years 4 months ago
2007
ACM
A wide variety of machine learning problems can be described as minimizing a regularized risk functional, with different algorithms using different notions of risk and different r...
132
Voted
KDD
2006
ACM
16 years 4 months ago
2006
ACM
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
131
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
We describe the first algorithms to compute minimum cuts in surface-embedded graphs in near-linear time. Given an undirected graph embedded on an orientable surface of genus g, w...