Sciweavers

11213 search results - page 86 / 2243
» Low-contention data structures
Sort
View
108
Voted
SPIRE
2005
Springer
15 years 9 months ago
Rank-Sensitive Data Structures
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
Iwona Bialynicka-Birula, Roberto Grossi
134
Voted
ECML
2007
Springer
15 years 9 months ago
Structure Learning of Probabilistic Relational Models from Incomplete Relational Data
Abstract. Existing relational learning approaches usually work on complete relational data, but real-world data are often incomplete. This paper proposes the MGDA approach to learn...
Xiao-Lin Li, Zhi-Hua Zhou
117
Voted
ADBIS
2010
Springer
145views Database» more  ADBIS 2010»
15 years 5 months ago
On Support of Ordering in Multidimensional Data Structures
Multidimensional data structures are applied in many areas, e.g. in data mining, indexing multimedia data and text documents, and so on. There are some applications where the range...
Filip Krizka, Michal Krátký, Radim B...
138
Voted
CIKM
1999
Springer
15 years 8 months ago
Automatically Extracting Structure and Data from Business Reports
A considerable amount of clean semistructured data is internally available to companies in the form of business reports. However, business reports are untapped for data mining, da...
Stephen W. Liddle, Douglas M. Campbell, Chad Crawf...
116
Voted
SIGCSE
2004
ACM
110views Education» more  SIGCSE 2004»
15 years 9 months ago
An extensible framework for providing dynamic data structure visualizations in a lightweight IDE
A framework for producing dynamic data structure visualizations within the context of a lightweight IDE is described. Multiple synchronized visualizations of a data structure can ...
T. Dean Hendrix, James H. Cross II, Larry A. Barow...