4850 search results - page 74 / 970 » Approximate Data Structures with Applications |
117
click to vote
RSA
2006
14 years 9 months ago
2006
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
PVLDB
2010
14 years 8 months ago
2010
We present in this paper ObjectRunner, a system for extracting, integrating and querying structured data from the Web. Our system harvests real-world items from template-based HTM...
TOIS
2002
14 years 9 months ago
2002
Many applications depend on efficient management of large sets of distinct strings in memory. For example, during index construction for text databases a record is held for each d...
108
click to vote
LWA
2008
14 years 11 months ago
2008
Information extraction is concerned with the location of specific items in (unstructured) textual documents, e.g., being applied for the acquisition of structured data. Then, the ...
PE
2007
Springer
14 years 9 months ago
2007
Springer
To develop simple traffic engineering rules for the downlink of a cellular system using Proportional Fairness (PF) scheduling, we study the “strict” and “approximate” ins...