Sciweavers

531 search results - page 75 / 107
» A Better Algorithm for Random k-SAT
Sort
View
ACMSE
2006
ACM
14 years 3 months ago
Discovering communities in complex networks
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
Hemant Balakrishnan, Narsingh Deo
EH
2003
IEEE
100views Hardware» more  EH 2003»
14 years 2 months ago
Learning for Evolutionary Design
This paper describes a technique for evolving similar solutions to similar configuration design problems. Using the configuration design of combination logic circuits as a testb...
Sushil J. Louis
KDD
1998
ACM
120views Data Mining» more  KDD 1998»
14 years 1 months ago
Large Datasets Lead to Overly Complex Models: An Explanation and a Solution
This paper explores unexpected results that lie at the intersection of two common themes in the KDD community: large datasets and the goal of building compact models. Experiments ...
Tim Oates, David Jensen
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
14 years 2 months ago
Highly Scalable and Accurate Seeds for Subsequence Alignment
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
Abhijit Pol, Tamer Kahveci
WWW
2011
ACM
13 years 3 months ago
Inverted index compression via online document routing
Modern search engines are expected to make documents searchable shortly after they appear on the ever changing Web. To satisfy this requirement, the Web is frequently crawled. Due...
Gal Lavee, Ronny Lempel, Edo Liberty, Oren Somekh