Sciweavers

1282 search results - page 209 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
113
Voted
SODA
2010
ACM
209views Algorithms» more  SODA 2010»
15 years 12 months ago
Counting Stars and Other Small Subgraphs in Sublinear Time
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...
Mira Gonen, Dana Ron, Yuval Shavitt
131
Voted
CN
2002
82views more  CN 2002»
15 years 2 months ago
Optimal allocation of electronic content
Abstract-The delivery of large files to single users, such as application programs for some versions of the envisioned network computer, or movies, is expected by many to be one of...
Israel Cidon, Shay Kutten, Ran Soffer
HPCS
2005
IEEE
15 years 8 months ago
A Lightweight, Scalable Grid Computing Framework for Parallel Bioinformatics Applications
Abstract— In recent years our society has witnessed an unprecedented growth in computing power available to tackle important problems in science, engineering and medicine. For ex...
Hans De Sterck, Rob S. Markel, Rob Knight
155
Voted
INFOCOM
2011
IEEE
14 years 6 months ago
Sensor localization with deterministic accuracy guarantee
—Localizability of network or node is an important subproblem in sensor localization. While rigidity theory plays an important role in identifying several localizability conditio...
Ryo Sugihara, Rajesh K. Gupta
STOC
1996
ACM
100views Algorithms» more  STOC 1996»
15 years 6 months ago
The Linear-Array Conjecture in Communication Complexity is False
A linear array network consists of k + 1 processors P0; P1; : : : ; Pk with links only between Pi and Pi+1 0 i k. It is required to compute some boolean function f x; y in this n...
Eyal Kushilevitz, Nathan Linial, Rafail Ostrovsky