Sciweavers

129 search results - page 8 / 26
» Fully distributed EM for very large datasets
Sort
View
CEAS
2006
Springer
13 years 11 months ago
Fast Uncertainty Sampling for Labeling Large E-mail Corpora
One of the biggest challenges in building effective anti-spam solutions is designing systems to defend against the everevolving bag of tricks spammers use to defeat them. Because ...
Richard Segal, Ted Markowitz, William Arnold
CIKM
2010
Springer
13 years 6 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
ICASSP
2010
IEEE
13 years 7 months ago
Automatic state discovery for unstructured audio scene classification
In this paper we present a novel scheme for unstructured audio scene classification that possesses three highly desirable and powerful features: autonomy, scalability, and robust...
Julian Ramos, Sajid M. Siddiqi, Artur Dubrawski, G...
KDD
2001
ACM
216views Data Mining» more  KDD 2001»
14 years 8 months ago
The distributed boosting algorithm
In this paper, we propose a general framework for distributed boosting intended for efficient integrating specialized classifiers learned over very large and distributed homogeneo...
Aleksandar Lazarevic, Zoran Obradovic
GIS
2007
ACM
14 years 8 months ago
Dynamic storage balancing in a distributed spatial index
We propose a general framework to index very large datasets of spatial data in a distributed system. Our proposal is built on the recently proposed Scalable Distributed Rtree (SD-...
Cédric du Mouza, Philippe Rigaux, Witold Li...