Sciweavers

1518 search results - page 74 / 304
» Exact and Approximate Bandwidth
Sort
View
FOCS
2008
IEEE
15 years 4 months ago
On the Value of Multiple Read/Write Streams for Approximating Frequency Moments
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...
Paul Beame, Dang-Trinh Huynh-Ngoc
WAW
2007
Springer
144views Algorithms» more  WAW 2007»
15 years 3 months ago
Approximating Betweenness Centrality
Betweenness is a centrality measure based on shortest paths, widely used in complex network analysis. It is computationally-expensive to exactly determine betweenness; currently th...
David A. Bader, Shiva Kintali, Kamesh Madduri, Mil...
VLDB
2005
ACM
104views Database» more  VLDB 2005»
15 years 3 months ago
Approximate Matching of Hierarchical Data Using pq-Grams
When integrating data from autonomous sources, exact matches of data items that represent the same real world object often fail due to a lack of common keys. Yet in many cases str...
Nikolaus Augsten, Michael H. Böhlen, Johann G...
COMPGEOM
2004
ACM
15 years 3 months ago
Approximate convex decomposition of polygons
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
Jyh-Ming Lien, Nancy M. Amato
COMPGEOM
1995
ACM
15 years 1 months ago
Approximate Range Searching
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
Sunil Arya, David M. Mount