Sciweavers

1000 search results - page 115 / 200
» Dependency Tree Automata
Sort
View
107
Voted
ICDM
2008
IEEE
99views Data Mining» more  ICDM 2008»
15 years 7 months ago
Finding Good Itemsets by Packing Data
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
Nikolaj Tatti, Jilles Vreeken
EGPGV
2004
Springer
181views Visualization» more  EGPGV 2004»
15 years 6 months ago
Parallel Multiresolution Volume Rendering of Large Data Sets with Error-Guided Load Balancing
We present a new parallel multiresolution volume rendering algorithm for visualizing large data sets. Using the wavelet transform, the raw data is first converted into a multires...
Chaoli Wang, Jinzhu Gao, Han-Wei Shen
NMR
2004
Springer
15 years 6 months ago
Towards higher impact argumentation
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting a...
Anthony Hunter
110
Voted
CIAC
1997
Springer
154views Algorithms» more  CIAC 1997»
15 years 5 months ago
Isomorphism for Graphs of Bounded Distance Width
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
Koichi Yamazaki, Hans L. Bodlaender, Babette de Fl...
121
Voted
DAC
2004
ACM
15 years 4 months ago
Quadratic placement using an improved timing model
The performance of timing-driven placement methods depends strongly on the choice of the net model. In this paper a more precise net model is presented that does not increase nume...
Bernd Obermeier, Frank M. Johannes