Sciweavers

1331 search results - page 233 / 267
» Complexity bounds for zero-test algorithms
Sort
View
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
13 years 11 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
ICDE
2006
IEEE
266views Database» more  ICDE 2006»
14 years 9 months ago
Approximation Techniques for Indexing the Earth Mover's Distance in Multimedia Databases
Todays abundance of storage coupled with digital technologies in virtually any scientific or commercial application such as medical and biological imaging or music archives deal w...
Ira Assent, Andrea Wenning, Thomas Seidl
GIS
2005
ACM
14 years 8 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
ICML
2008
IEEE
14 years 8 months ago
On the quantitative analysis of deep belief networks
Deep Belief Networks (DBN's) are generative models that contain many layers of hidden variables. Efficient greedy algorithms for learning and approximate inference have allow...
Ruslan Salakhutdinov, Iain Murray
CADE
2006
Springer
14 years 8 months ago
Stratified Context Unification Is NP-Complete
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...
Jordi Levy, Manfred Schmidt-Schauß, Mateu Vi...