Sciweavers

1633 search results - page 261 / 327
» Planar Map Graphs
Sort
View
WWW
2011
ACM
13 years 5 months ago
Counting triangles and the curse of the last reducer
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
Siddharth Suri, Sergei Vassilvitskii
VLDB
2008
ACM
103views Database» more  VLDB 2008»
14 years 10 months ago
The optimal sequenced route query
Several variations of nearest neighbor (NN) query have been investigated by the database community. However, realworld applications often result in the formulation of new variatio...
Mehdi Sharifzadeh, Mohammad R. Kolahdouzan, Cyrus ...
SIGMETRICS
2006
ACM
14 years 4 months ago
Robust network connectivity: when it's the big picture that matters
This work analyzes the connectivity of large diameter networks where every link has an independent probability p of failure. We give a (relatively simple) topological condition th...
Enoch Peserico, Larry Rudolph
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
14 years 3 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...
RT
2004
Springer
14 years 3 months ago
Bixels: Picture Samples with Sharp Embedded Boundaries
Pixels store a digital image as a grid of point samples that can reconstruct a limited-bandwidth continuous 2-D source image. Although convenient for anti-aliased display, these b...
Jack Tumblin, Prasun Choudhury