Sciweavers

813 search results - page 90 / 163
» On the Boolean-Width of a Graph: Structure and Applications
Sort
View
DASFAA
2007
IEEE
139views Database» more  DASFAA 2007»
14 years 3 months ago
Self-tuning in Graph-Based Reference Disambiguation
Nowadays many data mining/analysis applications use the graph analysis techniques for decision making. Many of these techniques are based on the importance of relationships among t...
Rabia Nuray-Turan, Dmitri V. Kalashnikov, Sharad M...
GLVLSI
2002
IEEE
160views VLSI» more  GLVLSI 2002»
14 years 2 months ago
Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
Whitney J. Townsend, Mitchell A. Thornton, Rolf Dr...
IPL
2010
71views more  IPL 2010»
13 years 7 months ago
New common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
Johannes Fischer, Daniel H. Huson
ECOOP
2006
Springer
14 years 24 days ago
Demeter Interfaces: Adaptive Programming Without Surprises
Adaptive Programming (AP) allows for the separate definition of data structures and traversals with attached computations, performed during the traversal, that operate on these dat...
Therapon Skotiniotis, Jeffrey Palm, Karl J. Lieber...
PPOPP
2009
ACM
14 years 9 months ago
Comparability graph coloring for optimizing utilization of stream register files in stream processors
A stream processor executes an application that has been decomposed into a sequence of kernels that operate on streams of data elements. During the execution of a kernel, all stre...
Xuejun Yang, Li Wang, Jingling Xue, Yu Deng, Ying ...