4850 search results - page 112 / 970 » Approximate Data Structures with Applications |
181
click to vote
ICDE
2000
IEEE
15 years 11 months ago
2000
IEEE
: Many companies have recognized the strategic importance of the knowledge hidden in their large databases and have built data warehouses. Typically, updates are collected and appl...
PLDI
2005
ACM
15 years 3 months ago
2005
ACM
This paper describes Automatic Pool Allocation, a transformation framework that segregates distinct instances of heap-based data structures into seperate memory pools and allows h...
122
click to vote
SDM
2011
SIAM
14 years 24 days ago
2011
SIAM
This paper describes one of the first attempts to model the temporal structure of massive data streams in real-time using data stream clustering. Recently, many data stream clust...
CP
2008
Springer
14 years 11 months ago
2008
Springer
We present an incremental refinement algorithm for approximate compilation of constraint satisfaction models into multivalued decision diagrams (MDDs). The algorithm uses a vertex ...
102
click to vote
ECOOP
2012
Springer
13 years 12 days ago
2012
Springer
As a culture, object-orientation encourages programmers to create objects, both short- and long-lived, without concern for cost. Excessive object creation and initialization can ca...