Sciweavers

4850 search results - page 97 / 970
» Approximate Data Structures with Applications
Sort
View
CODES
2010
IEEE
14 years 7 months ago
Automatic memory partitioning: increasing memory parallelism via data structure partitioning
In high-level synthesis, pipelined designs are often restricted by the number of memory banks available to the synthesis system. Using multiple memory banks can improve the perfor...
Yosi Ben-Asher, Nadav Rotem
CIDR
2011
188views Algorithms» more  CIDR 2011»
14 years 1 months ago
Managing Structured Collections of Community Data
Data management is becoming increasingly social. We observe a new form of information in such collaborative scenarios, where users contribute and reuse information, which resides ...
Wolfgang Gatterbauer, Dan Suciu
ICML
2009
IEEE
15 years 10 months ago
Structure learning with independent non-identically distributed data
There are well known algorithms for learning the structure of directed and undirected graphical models from data, but nearly all assume that the data consists of a single i.i.d. s...
Robert E. Tillman
BPM
2006
Springer
158views Business» more  BPM 2006»
15 years 1 months ago
Flexibility of Data-Driven Process Structures
Abstract. The coordination of complex process structures is a fundamental task for enterprises, such as in the automotive industry. Usually, such process structures consist of seve...
Dominic Müller, Manfred Reichert, Joachim Her...
WEA
2010
Springer
545views Algorithms» more  WEA 2010»
15 years 4 months ago
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
Abstract. The disjoint-set data structure is used to maintain a collection of non-overlapping sets of elements from a finite universe. Algorithms that operate on this data structu...
Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik...