Sciweavers

9849 search results - page 181 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
183
Voted
CORR
2011
Springer
124views Education» more  CORR 2011»
15 years 1 months ago
Parallel Recursive State Compression for Free
This paper focuses on reducing memory usage in enumerative model checking, while maintaining the multi-core scalability obtained in earlier work. We present a multi-core tree-based...
Alfons Laarman, Jaco van de Pol, Michael Weber 000...
LCN
2007
IEEE
16 years 1 months ago
Search Algorithms for Unstructured Peer-to-Peer Networks
Abstract—We study the performance of several search algorithms on unstructured peer-to-peer networks, both using classic search algorithms such as flooding and random walk, as w...
Reza Dorrigiv, Alejandro López-Ortiz, Pawel...
BMCBI
2008
178views more  BMCBI 2008»
15 years 7 months ago
Identification of coherent patterns in gene expression data using an efficient biclustering algorithm and parallel coordinate vi
Background: The DNA microarray technology allows the measurement of expression levels of thousands of genes under tens/hundreds of different conditions. In microarray data, genes ...
Kin-On Cheng, Ngai-Fong Law, Wan-Chi Siu, Alan Wee...
AI
2005
Springer
15 years 6 months ago
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
Katsutoshi Hirayama, Makoto Yokoo
NAACL
2010
15 years 4 months ago
Multi-document Summarization via Budgeted Maximization of Submodular Functions
We treat the text summarization problem as maximizing a submodular function under a budget constraint. We show, both theoretically and empirically, a modified greedy algorithm can...
Hui Lin, Jeff Bilmes