Sciweavers

26354 search results - page 5175 / 5271
» How we refactor, and how we know it
Sort
View
PODC
2009
ACM
16 years 2 months ago
Max registers, counters, and monotone circuits
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
James Aspnes, Hagit Attiya, Keren Censor
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
16 years 2 months ago
Efficiently learning the accuracy of labeling sources for selective sampling
Many scalable data mining tasks rely on active learning to provide the most useful accurately labeled instances. However, what if there are multiple labeling sources (`oracles...
Pinar Donmez, Jaime G. Carbonell, Jeff Schneider
KDD
2009
ACM
262views Data Mining» more  KDD 2009»
16 years 2 months ago
Sentiment analysis of blogs by combining lexical knowledge with text classification
The explosion of user-generated content on the Web has led to new opportunities and significant challenges for companies, that are increasingly concerned about monitoring the disc...
Prem Melville, Wojciech Gryc, Richard D. Lawrence
KDD
2007
ACM
181views Data Mining» more  KDD 2007»
16 years 2 months ago
BoostCluster: boosting clustering by pairwise constraints
Data clustering is an important task in many disciplines. A large number of studies have attempted to improve clustering by using the side information that is often encoded as pai...
Yi Liu, Rong Jin, Anil K. Jain
KDD
2002
ACM
182views Data Mining» more  KDD 2002»
16 years 1 months ago
ANF: a fast and scalable tool for data mining in massive graphs
Graphs are an increasingly important data source, with such important graphs as the Internet and the Web. Other familiar graphs include CAD circuits, phone records, gene sequences...
Christopher R. Palmer, Phillip B. Gibbons, Christo...
« Prev « First page 5175 / 5271 Last » Next »