Sciweavers

3708 search results - page 49 / 742
» Approximating Betweenness Centrality
Sort
View
INFOCOM
2009
IEEE
14 years 5 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar
SODA
2007
ACM
127views Algorithms» more  SODA 2007»
14 years 12 days ago
Line-of-sight networks
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
Alan M. Frieze, Jon M. Kleinberg, R. Ravi, Warren ...
BMCBI
2007
107views more  BMCBI 2007»
13 years 11 months ago
A general and efficient method for estimating continuous IBD functions for use in genome scans for QTL
Background: Identity by descent (IBD) matrix estimation is a central component in mapping of Quantitative Trait Loci (QTL) using variance component models. A large number of algor...
Francois Besnier, Örjan Carlborg
ICPR
2000
IEEE
15 years 2 days ago
Piecewise Linear Skeletonization Using Principal Curves
We propose an algorithm to find piecewise linear skeletons of hand-written characters by using principal curves. The development of the method was inspired by the apparent similar...
Adam Krzyzak, Balázs Kégl
SPIRE
2000
Springer
14 years 2 months ago
Combinatorial Methods for Approximate Pattern Matching under Rotations and Translations in 3D Arrays
We consider the problem of defining and evaluating the distance between three
Kimmo Fredriksson, Esko Ukkonen