Sciweavers

1268 search results - page 236 / 254
» An Algorithm for Distributed Beacon Selection
Sort
View
KDD
2006
ACM
179views Data Mining» more  KDD 2006»
16 years 2 months ago
Extracting key-substring-group features for text classification
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
Dell Zhang, Wee Sun Lee
KDD
2005
ACM
170views Data Mining» more  KDD 2005»
16 years 2 months ago
Parallel mining of closed sequential patterns
Discovery of sequential patterns is an essential data mining task with broad applications. Among several variations of sequential patterns, closed sequential pattern is the most u...
Shengnan Cong, Jiawei Han, David A. Padua
204
Voted
SIGMOD
2006
ACM
111views Database» more  SIGMOD 2006»
16 years 1 months ago
Reconciling while tolerating disagreement in collaborative data sharing
In many data sharing settings, such as within the biological and biomedical communities, global data consistency is not always attainable: different sites' data may be dirty,...
Nicholas E. Taylor, Zachary G. Ives
142
Voted
WSDM
2010
ACM
213views Data Mining» more  WSDM 2010»
15 years 11 months ago
Corroborating Information from Disagreeing Views
We consider a set of views stating possibly conflicting facts. Negative facts in the views may come, e.g., from functional dependencies in the underlying database schema. We want ...
Alban Galland, Serge Abiteboul, Amélie Mari...
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
15 years 11 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...