Sciweavers

4542 search results - page 503 / 909
» Design patterns for data structures
Sort
View
SAGA
2001
Springer
15 years 11 months ago
Stochastic Finite Learning
Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to potential ap...
Thomas Zeugmann
WWW
2007
ACM
16 years 7 months ago
Querying and maintaining a compact XML storage
As XML database sizes grow, the amount of space used for storing the data and auxiliary data structures becomes a major factor in query and update performance. This paper presents...
Raymond K. Wong, Franky Lam, William M. Shui
ICNP
2006
IEEE
16 years 25 days ago
DPTree: A Balanced Tree Based Indexing Framework for Peer-to-Peer Systems
— Peer-to-peer (P2P) systems have been widely used for exchange of voluminous information and resources among thousands or even millions of users. Since shared data are normally ...
Mei Li, Wang-Chien Lee, Anand Sivasubramaniam
JCDL
2006
ACM
237views Education» more  JCDL 2006»
16 years 22 days ago
Automatic extraction of table metadata from digital documents
Tables are used to present, list, summarize, and structure important data in documents. In scholarly articles, they are often used to present the relationships among data and high...
Ying Liu, Prasenjit Mitra, C. Lee Giles, Kun Bai
UIST
2006
ACM
16 years 22 days ago
Enabling web browsers to augment web sites' filtering and sorting functionalities
Existing augmentations of web pages are mostly small cosmetic changes (e.g., removing ads) and minor addition of third-party content (e.g., product prices from competing sites). N...
David F. Huynh, Robert C. Miller, David R. Karger