Sciweavers

352 search results - page 56 / 71
» Fast Graph Pattern Matching
Sort
View
ACSC
2000
IEEE
15 years 6 months ago
Needles and Haystacks: A Search Engine for Personal Information Collections
Information retrieval systems can be partitioned into two main classes: large-scale systems that make use of an inverted index or some other auxiliary data structure, intended for...
Owen de Kretser, Alistair Moffat
124
Voted
ICNP
2005
IEEE
15 years 7 months ago
On Static and Dynamic Partitioning Behavior of Large-Scale Networks
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affec...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...
114
Voted
FOCS
2003
IEEE
15 years 7 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
130
Voted
IANDC
2008
141views more  IANDC 2008»
15 years 1 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
PR
2007
141views more  PR 2007»
15 years 1 months ago
A Riemannian approach to graph embedding
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
Antonio Robles-Kelly, Edwin R. Hancock