Sciweavers

467 search results - page 81 / 94
» Roadmap of Infinite Results
Sort
View
KDD
2008
ACM
119views Data Mining» more  KDD 2008»
14 years 8 months ago
SAIL: summation-based incremental learning for information-theoretic clustering
Information-theoretic clustering aims to exploit information theoretic measures as the clustering criteria. A common practice on this topic is so-called INFO-K-means, which perfor...
Junjie Wu, Hui Xiong, Jian Chen
POPL
2008
ACM
14 years 8 months ago
Generating precise and concise procedure summaries
We present a framework for generating procedure summaries that are precise -- applying the summary in a given context yields the same result as re-analyzing the procedure in that ...
Greta Yorsh, Eran Yahav, Satish Chandra
STOC
2007
ACM
83views Algorithms» more  STOC 2007»
14 years 8 months ago
Lattices that admit logarithmic worst-case to average-case connection factors
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
Chris Peikert, Alon Rosen
SIGMOD
2005
ACM
119views Database» more  SIGMOD 2005»
14 years 7 months ago
Update-Pattern-Aware Modeling and Processing of Continuous Queries
A defining characteristic of continuous queries over on-line data streams, possibly bounded by sliding windows, is the potentially infinite and time-evolving nature of their input...
Lukasz Golab, M. Tamer Özsu
SMC
2007
IEEE
125views Control Systems» more  SMC 2007»
14 years 2 months ago
Scaling with digital connection: Services innovation
—Digitization of production factors, including the knowledge for knowledge workers and consumers, opens almost infinite potential to connect persons, systems, processes, enterpri...
Cheng Hsu