Sciweavers

730 search results - page 114 / 146
» Combinatorics of Monotone Computations
Sort
View
ICDE
2002
IEEE
106views Database» more  ICDE 2002»
14 years 9 months ago
OSSM: A Segmentation Approach to Optimize Frequency Counting
Computing the frequency of a pattern is one of the key operations in data mining algorithms. We describe a simple yet powerful way of speeding up any form of frequency counting sa...
Carson Kai-Sang Leung, Raymond T. Ng, Heikki Manni...
IPMI
2005
Springer
14 years 8 months ago
The Role of Non-Overlap in Image Registration
Here we model the effect of non-overlapping voxels on image registration, and show that a major defect of overlap-only models--their limited capture range--can be alleviated. Theor...
Jonas August, Takeo Kanade
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
14 years 8 months ago
Kernel k-means: spectral clustering and normalized cuts
Kernel k-means and spectral clustering have both been used to identify clusters that are non-linearly separable in input space. Despite significant research, these methods have re...
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
14 years 8 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
STOC
2003
ACM
102views Algorithms» more  STOC 2003»
14 years 7 months ago
Some 3CNF properties are hard to test
For a Boolean formula on n variables, the associated property P is the collection of n-bit strings that satisfy . We study the query complexity of tests that distinguish (with hig...
Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodniko...