Sciweavers

820 search results - page 108 / 164
» Finding low-utility data structures
Sort
View
CIDR
2009
129views Algorithms» more  CIDR 2009»
13 years 10 months ago
Extracting and Querying a Comprehensive Web Database
Recent research in domain-independent information extraction holds the promise of an automatically-constructed structured database derived from the Web. A query system based on th...
Michael J. Cafarella
TVCG
2008
133views more  TVCG 2008»
13 years 8 months ago
Texture-based Transfer Functions for Direct Volume Rendering
Visualization of volumetric data faces the difficult task of finding effective parameters for the transfer functions. Those parameters can determine the effectiveness and accuracy ...
Jesus Caban, Penny Rheingans
BMCBI
2008
125views more  BMCBI 2008»
13 years 9 months ago
Exploration and visualization of gene expression with neuroanatomy in the adult mouse brain
Background: Spatially mapped large scale gene expression databases enable quantitative comparison of data measurements across genes, anatomy, and phenotype. In most ongoing effort...
Christopher Lau, Lydia Ng, Carol Thompson, Sayan D...
STOC
1996
ACM
115views Algorithms» more  STOC 1996»
14 years 1 months ago
Minimum Cuts in Near-Linear Time
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
David R. Karger
TON
2002
86views more  TON 2002»
13 years 8 months ago
Efficient randomized web-cache replacement schemes using samples from past eviction times
The problem of document replacement in web caches has received much attention in recent research, and it has been shown that the eviction rule "replace the least recently used...
Konstantinos Psounis, Balaji Prabhakar