Sciweavers

1254 search results - page 236 / 251
» Making Hard Problems Harder
Sort
View
WSDM
2009
ACM
136views Data Mining» more  WSDM 2009»
14 years 3 months ago
Mining common topics from multiple asynchronous text streams
Text streams are becoming more and more ubiquitous, in the forms of news feeds, weblog archives and so on, which result in a large volume of data. An effective way to explore the...
Xiang Wang 0002, Kai Zhang, Xiaoming Jin, Dou Shen
CIKM
2009
Springer
14 years 3 months ago
Incremental query evaluation for support vector machines
Support vector machines (SVMs) have been widely used in multimedia retrieval to learn a concept in order to find the best matches. In such a SVM active learning environment, the ...
Danzhou Liu, Kien A. Hua
SIGCOMM
2009
ACM
14 years 3 months ago
CrossTalk: scalably interconnecting instant messaging networks
We consider the problem of interconnecting a simple type of social network: Instant Messaging services. Today, users are members of various IM communities such as AOL, Yahoo, and ...
Marti A. Motoyama, George Varghese
SIGIR
2009
ACM
14 years 3 months ago
Addressing morphological variation in alphabetic languages
The selection of indexing terms for representing documents is a key decision that limits how effective subsequent retrieval can be. Often stemming algorithms are used to normaliz...
Paul McNamee, Charles K. Nicholas, James Mayfield
HPDC
2007
IEEE
14 years 3 months ago
Failure-aware checkpointing in fine-grained cycle sharing systems
Fine-Grained Cycle Sharing (FGCS) systems aim at utilizing the large amount of idle computational resources available on the Internet. Such systems allow guest jobs to run on a ho...
Xiaojuan Ren, Rudolf Eigenmann, Saurabh Bagchi