Sciweavers

169 search results - page 28 / 34
» Layered Working-Set Trees
Sort
View
126
Voted
JIDM
2010
155views more  JIDM 2010»
15 years 9 days ago
DeweyIDs - The Key to Fine-Grained Management of XML Documents
Because XML documents tend to be very large and are more and more collaboratively processed, their fine-grained storage and management is a must for which, in turn, a flexible tree...
Michael Peter Haustein, Theo Härder, Christia...
97
Voted
FLAIRS
2004
15 years 3 months ago
An Application of Neural Networks to Sequence Analysis and Genre Identification
This study borrowed sequence analysis techniques from the genetic sciences and applied them to a similar problem in email filtering and web searching. Genre identification is the ...
David Bisant
110
Voted
SODA
2010
ACM
149views Algorithms» more  SODA 2010»
15 years 11 months ago
Resource Minimization for Fire Containment
We consider the following model for fire containment. We are given an undirected graph G = (V, E) with a source vertex s where the fire starts. At each time step, the firefighters...
Parinya Chalermsook, Julia Chuzhoy
142
Voted
INFOCOM
2003
IEEE
15 years 7 months ago
Exploring the trade-off between label size and stack depth in MPLS Routing
— Multiprotocol Label Switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineer...
Anupam Gupta, Amit Kumar, Rajeev Rastogi
110
Voted
OSDI
1996
ACM
15 years 3 months ago
Automatic Compiler-Inserted I/O Prefetching for Out-of-Core Applications
Current operating systems offer poor performance when a numeric application's working set does not fit in main memory. As a result, programmers who wish to solve "out-of...
Todd C. Mowry, Angela K. Demke, Orran Krieger