Sciweavers

150 search results - page 14 / 30
» A General Technique for Managing Strings in Comparison-Drive...
Sort
View
JACM
2007
132views more  JACM 2007»
13 years 6 months ago
Dynamic ordered sets with exponential search trees
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
Arne Andersson, Mikkel Thorup
WIDM
2003
ACM
13 years 12 months ago
XVerter: querying XML data with OR-DBMS
Storage techniques and queries over XML databases are being widely studied. Most works store XML documents in traditional DBMSs in order to take advantage of a well established te...
Humberto Vieira, Gabriela Ruberg, Marta Mattoso
WWW
2009
ACM
14 years 7 months ago
Extracting community structure through relational hypergraphs
Social media websites promote diverse user interaction on media objects as well as user actions with respect to other users. The goal of this work is to discover community structu...
Yu-Ru Lin, Jimeng Sun, Paul Castro, Ravi B. Konuru...
EMSOFT
2006
Springer
13 years 10 months ago
Reliability mechanisms for file systems using non-volatile memory as a metadata store
Portable systems such as cell phones and portable media players commonly use non-volatile RAM (NVRAM) to hold all of their data and metadata, and larger systems can store metadata...
Kevin M. Greenan, Ethan L. Miller
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
14 years 7 months ago
Assessing data mining results via swap randomization
The problem of assessing the significance of data mining results on high-dimensional 0?1 data sets has been studied extensively in the literature. For problems such as mining freq...
Aristides Gionis, Heikki Mannila, Panayiotis Tsapa...