Sciweavers

199 search results - page 26 / 40
» Intensional Positive Set Theory
Sort
View
CVPR
2007
IEEE
14 years 9 months ago
Detector Ensemble
Component-based detection methods have demonstrated their promise by integrating a set of part-detectors to deal with large appearance variations of the target. However, an essent...
Shengyang Dai, Ming Yang, Ying Wu, Aggelos K. Kats...
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
14 years 8 months ago
Randomly supported independence and resistance
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
Per Austrin, Johan Håstad
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
ESA
2009
Springer
90views Algorithms» more  ESA 2009»
14 years 2 months ago
Storing a Compressed Function with Constant Time Access
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
Jóhannes B. Hreinsson, Morten Krøyer...
BIRTHDAY
2005
Springer
14 years 1 months ago
Finite Equational Bases in Process Algebra: Results and Open Questions
Abstract. Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these...
Luca Aceto, Wan Fokkink, Anna Ingólfsd&oacu...