Sciweavers

678 search results - page 123 / 136
» Structural Properties of Sparse Graphs
Sort
View
MSWIM
2006
ACM
14 years 1 months ago
The power of choice in random walks: an empirical study
In recent years different authors have proposed the used of random-walk-based algorithms for varying tasks in the networking community. These proposals include searching, routing...
Chen Avin, Bhaskar Krishnamachari
ICDM
2005
IEEE
215views Data Mining» more  ICDM 2005»
14 years 1 months ago
CLUGO: A Clustering Algorithm for Automated Functional Annotations Based on Gene Ontology
We address the issue of providing highly informative and comprehensive annotations using information revealed by the structured vocabularies of Gene Ontology (GO). For a target, a...
In-Yee Lee, Jan-Ming Ho, Ming-Syan Chen
P2P
2005
IEEE
137views Communications» more  P2P 2005»
14 years 1 months ago
The Essence of P2P: A Reference Architecture for Overlay Networks
The success of the P2P idea has created a huge diversity of approaches, among which overlay networks, for example, Gnutella, Kazaa, Chord, Pastry, Tapestry, P-Grid, or DKS, have r...
Karl Aberer, Luc Onana Alima, Ali Ghodsi, Sarunas ...
FCT
2005
Springer
14 years 1 months ago
On the Incompressibility of Monotone DNFs
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
Matthias P. Krieger
ICDT
2005
ACM
125views Database» more  ICDT 2005»
14 years 1 months ago
PTIME Queries Revisited
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
Alan Nash, Jeffrey B. Remmel, Victor Vianu