Sciweavers

933 search results - page 161 / 187
» Centrality Estimation in Large Networks
Sort
View
FPGA
1998
ACM
132views FPGA» more  FPGA 1998»
15 years 1 months ago
Circuit Partitioning with Complex Resource Constraints in FPGAs
In this paper, we present an algorithm for circuit partitioning with complex resource constraints in large FPGAs. Traditional partitioning methods estimate the capacity of an FPGA...
Huiqun Liu, Kai Zhu, D. F. Wong
BMCBI
2006
117views more  BMCBI 2006»
14 years 9 months ago
The Cluster Variation Method for Efficient Linkage Analysis on Extended Pedigrees
Background: Computing exact multipoint LOD scores for extended pedigrees rapidly becomes infeasible as the number of markers and untyped individuals increase. When markers are exc...
Cornelis A. Albers, Martijn A. R. Leisink, Hilbert...
IPSN
2007
Springer
15 years 3 months ago
Robust system multiangulation using subspace methods
Sensor location information is a prerequisite to the utility of most sensor networks. In this paper we present a robust and low-complexity algorithm to self-localize and orient se...
Joshua N. Ash, Lee C. Potter
VLDB
2002
ACM
137views Database» more  VLDB 2002»
14 years 9 months ago
Comparing Data Streams Using Hamming Norms (How to Zero In)
Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely s...
Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthu...
68
Voted
WWW
2009
ACM
15 years 10 months ago
Social search in "Small-World" experiments
The "algorithmic small-world hypothesis" states that not only are pairs of individuals in a large social network connected by short paths, but that ordinary individuals ...
Sharad Goel, Roby Muhamad, Duncan J. Watts