Sciweavers

4372 search results - page 517 / 875
» Algorithmic Theories of Everything
Sort
View
KDD
2004
ACM
190views Data Mining» more  KDD 2004»
16 years 7 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
POPL
2004
ACM
16 years 7 months ago
A logic you can count on
We prove the decidability of the quantifier-free, static fragment of ambient logic, with composition adjunct and iteration, which corresponds to a kind of regular expression langu...
Silvano Dal-Zilio, Denis Lugiez, Charles Meyssonni...
STOC
2004
ACM
177views Algorithms» more  STOC 2004»
16 years 7 months ago
Lower bounds for linear degeneracy testing
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
Nir Ailon, Bernard Chazelle
SIGMOD
2009
ACM
191views Database» more  SIGMOD 2009»
16 years 7 months ago
Scalable skyline computation using object-based space partitioning
The skyline operator returns from a set of multi-dimensional objects a subset of superior objects that are not dominated by others. This operation is considered very important in ...
Shiming Zhang, Nikos Mamoulis, David W. Cheung
SIGMOD
2007
ACM
121views Database» more  SIGMOD 2007»
16 years 7 months ago
EaseDB: a cache-oblivious in-memory query processor
We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers t...
Bingsheng He, Yinan Li, Qiong Luo, Dongqing Yang