Sciweavers

1321 search results - page 171 / 265
» Quadratic forms on graphs
Sort
View
ICDE
2005
IEEE
103views Database» more  ICDE 2005»
14 years 11 months ago
Vectorizing and Querying Large XML Repositories
Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to sto...
Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutc...
WWW
2005
ACM
14 years 10 months ago
TotalRank: ranking without damping
PageRank is defined as the stationary state of a Markov chain obtained by perturbing the transition matrix of a web graph with a damping factor that spreads part of the rank. The...
Paolo Boldi
STOC
2009
ACM
155views Algorithms» more  STOC 2009»
14 years 10 months ago
A nearly optimal oracle for avoiding failed vertices and edges
We present an improved oracle for the distance sensitivity problem. The goal is to preprocess a directed graph G = (V, E) with non-negative edge weights to answer queries of the f...
Aaron Bernstein, David R. Karger
RECOMB
2005
Springer
14 years 10 months ago
Combinatorial Genetic Regulatory Network Analysis Tools for High Throughput Transcriptomic Data
: A series of genome-scale algorithms and high-performance implementations is described and shown to be useful in the genetic analysis of gene transcription. With them it is possib...
Elissa J. Chesler, Michael A. Langston
EDBT
2006
ACM
120views Database» more  EDBT 2006»
14 years 10 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...