Sciweavers

8728 search results - page 15 / 1746
» On Reduct Construction Algorithms
Sort
View
SODA
2012
ACM
227views Algorithms» more  SODA 2012»
11 years 11 months ago
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
François Le Gall
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 9 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
AIPS
2008
13 years 11 months ago
A New Probabilistic Plan Recognition Algorithm Based on String Rewriting
This document formalizes and discusses the implementation of a new, more efficient probabilistic plan recognition algorithm called Yet Another Probabilistic Plan Recognizer, (Yapp...
Christopher W. Geib, John Maraist, Robert P. Goldm...
SIGMOD
2006
ACM
131views Database» more  SIGMOD 2006»
14 years 9 months ago
An automatic construction and organization strategy for ensemble learning on data streams
As data streams are gaining prominence in a growing number of emerging application domains, classification on data streams is becoming an active research area. Currently, the typi...
Yi Zhang, Xiaoming Jin
NIPS
2004
13 years 10 months ago
Proximity Graphs for Clustering and Manifold Learning
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
Miguel Á. Carreira-Perpiñán, ...