Sciweavers

1285 search results - page 177 / 257
» On the Complexity of Ordinal Clustering
Sort
View
KDD
2009
ACM
204views Data Mining» more  KDD 2009»
14 years 10 months ago
DOULION: counting triangles in massive graphs with a coin
Counting the number of triangles in a graph is a beautiful algorithmic problem which has gained importance over the last years due to its significant role in complex network analy...
Charalampos E. Tsourakakis, U. Kang, Gary L. Mille...
RECOMB
2008
Springer
14 years 10 months ago
CompostBin: A DNA Composition-Based Algorithm for Binning Environmental Shotgun Reads
A major hindrance to studies of microbial diversity has been that the vast majority of microbes cannot be cultured in the laboratory and thus are not amenable to traditional method...
Sourav Chatterji, Ichitaro Yamazaki, Zhaojun Bai, ...
SOSP
2007
ACM
14 years 7 months ago
Sinfonia: a new paradigm for building scalable distributed systems
We propose a new paradigm for building scalable distributed systems. Our approach does not require dealing with message-passing protocols—a major complication in existing distri...
Marcos Kawazoe Aguilera, Arif Merchant, Mehul A. S...
ISPAN
2009
IEEE
14 years 4 months ago
Cyberaide Creative: On-Demand Cyberinfrastructure Provision in Clouds
As demand for grid and cloud computing solutions increases, the need for user oriented software to provide access to theses resources also increases. Until recently the use of com...
Casey Rathbone, Lizhe Wang, Gregor von Laszewski, ...
DEBS
2009
ACM
14 years 4 months ago
Distributed event stream processing with non-deterministic finite automata
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
Lars Brenna, Johannes Gehrke, Mingsheng Hong, Dag ...