Sciweavers

447 search results - page 72 / 90
» Bounded Model Checking with Parametric Data Structures
Sort
View
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
ICDM
2003
IEEE
101views Data Mining» more  ICDM 2003»
14 years 28 days ago
Interactive Visualization and Navigation in Large Data Collections using the Hyperbolic Space
We propose the combination of two recently introduced methods for the interactive visual data mining of large collections of data. Both, Hyperbolic Multi-Dimensional Scaling (HMDS...
Jörg A. Walter, Jörg Ontrup, Daniel Wess...
VRST
2009
ACM
14 years 2 months ago
The virtual magic lantern: an interaction metaphor for enhanced medical data inspection
In Volume Rendering, it is difficult to simultaneously visualize interior and exterior structures. Several approaches have been developed to solve this problem, such as cut-away ...
Eva Monclús, José Díaz, Isabe...
SPAA
2004
ACM
14 years 1 months ago
On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs
A key capability of data-race detectors is to determine whether one thread executes logically in parallel with another or whether the threads must operate in series. This paper pr...
Michael A. Bender, Jeremy T. Fineman, Seth Gilbert...
PPOPP
2010
ACM
14 years 4 months ago
Scalable communication protocols for dynamic sparse data exchange
Many large-scale parallel programs follow a bulk synchronous parallel (BSP) structure with distinct computation and communication phases. Although the communication phase in such ...
Torsten Hoefler, Christian Siebert, Andrew Lumsdai...