Sciweavers

82 search results - page 14 / 17
» Almost Random Projection Machine
Sort
View
93
Voted
PROVSEC
2009
Springer
15 years 4 months ago
Oracle Separation in the Non-uniform Model
Abstract. Oracle separation methods are used in cryptography to rule out blackbox reductions between cryptographic primitives. It is sufficient to find an oracle relative to whic...
Ahto Buldas, Sven Laur, Margus Niitsoo
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
15 years 3 months ago
Overlapping experiment infrastructure: more, better, faster experimentation
At Google, experimentation is practically a mantra; we evaluate almost every change that potentially affects what our users experience. Such changes include not only obvious user-...
Diane Tang, Ashish Agarwal, Deirdre O'Brien, Mike ...
AI50
2006
15 years 3 months ago
Fifty Years of AI: From Symbols to Embodiment - and Back
There are many stories to tell about the first fifty years of AI. One story is about AI as one of the big forces of innovation in information technology. It is now forgotten that i...
Luc Steels
115
Voted
PAKDD
2009
ACM
209views Data Mining» more  PAKDD 2009»
15 years 8 months ago
Approximate Spectral Clustering.
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
Christopher Leckie, James C. Bezdek, Kotagiri Rama...
109
Voted
COCO
1998
Springer
123views Algorithms» more  COCO 1998»
15 years 3 months ago
Isolation, Matching, and Counting
We show that the perfect matching problem is in the complexity class SPL in the nonuniform setting. This provides a better upper bound on the complexity of the matching problem, a...
Eric Allender, Klaus Reinhardt