Sciweavers

4266 search results - page 610 / 854
» Search for More Declarativity
Sort
View
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 6 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
16 years 6 months ago
Time series shapelets: a new primitive for data mining
Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm ...
Lexiang Ye, Eamonn J. Keogh
KDD
2007
ACM
155views Data Mining» more  KDD 2007»
16 years 6 months ago
A framework for community identification in dynamic social networks
We propose frameworks and algorithms for identifying communities in social networks that change over time. Communities are intuitively characterized as "unusually densely kni...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf, D...
KDD
2007
ACM
189views Data Mining» more  KDD 2007»
16 years 6 months ago
Corroborate and learn facts from the web
The web contains lots of interesting factual information about entities, such as celebrities, movies or products. This paper describes a robust bootstrapping approach to corrobora...
Shubin Zhao, Jonathan Betz
KDD
2007
ACM
122views Data Mining» more  KDD 2007»
16 years 6 months ago
Expertise modeling for matching papers with reviewers
An essential part of an expert-finding task, such as matching reviewers to submitted papers, is the ability to model the expertise of a person based on documents. We evaluate seve...
David M. Mimno, Andrew McCallum