Sciweavers

10414 search results - page 1715 / 2083
» An efficient algorithm for Co-segmentation
Sort
View
153
Voted
SPAA
2009
ACM
16 years 5 months ago
A DoS-resilient information system for dynamic data management
Denial of service (DoS) attacks are arguably one of the most cumbersome problems in the Internet. This paper presents a distributed information system (over a set of completely co...
Matthias Baumgart, Christian Scheideler, Stefan Sc...
129
Voted
CAV
2009
Springer
135views Hardware» more  CAV 2009»
16 years 5 months ago
Sliding Window Abstraction for Infinite Markov Chains
Window Abstraction for Infinite Markov Chains Thomas A. Henzinger1 , Maria Mateescu1 , and Verena Wolf1,2 1 EPFL, Switzerland 2 Saarland University, Germany Abstract. We present an...
Thomas A. Henzinger, Maria Mateescu, Verena Wolf
KDD
2009
ACM
193views Data Mining» more  KDD 2009»
16 years 5 months ago
Probabilistic frequent itemset mining in uncertain databases
Probabilistic frequent itemset mining in uncertain transaction databases semantically and computationally differs from traditional techniques applied to standard "certain&quo...
Andreas Züfle, Florian Verhein, Hans-Peter Kr...
KDD
2008
ACM
167views Data Mining» more  KDD 2008»
16 years 5 months ago
A sequential dual method for large scale multi-class linear svms
Efficient training of direct multi-class formulations of linear Support Vector Machines is very useful in applications such as text classification with a huge number examples as w...
S. Sathiya Keerthi, S. Sundararajan, Kai-Wei Chang...
150
Voted
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
16 years 5 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
« Prev « First page 1715 / 2083 Last » Next »