Sciweavers

286 search results - page 55 / 58
» Application-Tailored XML Storage
Sort
View
WWW
2007
ACM
14 years 8 months ago
Dynamic personalized pagerank in entity-relation graphs
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
Soumen Chakrabarti
STOC
2007
ACM
142views Algorithms» more  STOC 2007»
14 years 7 months ago
Lower bounds for randomized read/write stream algorithms
Motivated by the capabilities of modern storage architectures, we consider the following generalization of the data stream model where the algorithm has sequential access to multi...
Paul Beame, T. S. Jayram, Atri Rudra
SIGMOD
2001
ACM
134views Database» more  SIGMOD 2001»
14 years 7 months ago
Preservation of Digital Data with Self-Validating, Self-Instantiating Knowledge-Based Archives
Digital archives are dedicated to the long-term preservation of electronic information and have the mandate to enable sustained access despite rapid technology changes. Persistent...
Bertram Ludäscher, Richard Marciano, Reagan Moore
MM
2005
ACM
103views Multimedia» more  MM 2005»
14 years 1 months ago
IrisNet: an internet-scale architecture for multimedia sensors
Most current sensor network research explores the use of extremely simple sensors on small devices called motes and focuses on overcoming the resource constraints of these devices...
Jason Campbell, Phillip B. Gibbons, Suman Nath, Pa...
CIKM
2005
Springer
14 years 1 months ago
Compact reachability labeling for graph-structured data
Testing reachability between nodes in a graph is a well-known problem with many important applications, including knowledge representation, program analysis, and more recently, bi...
Hao He, Haixun Wang, Jun Yang 0001, Philip S. Yu