7228 search results - page 518 / 1446 » From Algorithmic to Subjective Randomness |
217
Voted
SAC
2006
ACM
16 years 27 days ago
2006
ACM
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
149
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
We provide a smoothed analysis of Hoare’s find algorithm and we revisit the smoothed analysis of quicksort. Hoare’s find algorithm – often called quickselect – is an easy...
191
click to vote
COMPGEOM
2003
ACM
16 years 5 days ago
2003
ACM
I discuss algorithms based on bistellar flips for inserting and deleting constraining (d − 1)-facets in d-dimensional constrained Delaunay triangulations (CDTs) and weighted CD...
212
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
192
click to vote
PODC
2005
ACM
16 years 15 days ago
2005
ACM
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown topology, asynchronous wake-up, and no collision detecti...