Sciweavers

5606 search results - page 456 / 1122
» Randomization Techniques for Graphs.
Sort
View
GLVLSI
2002
IEEE
160views VLSI» more  GLVLSI 2002»
15 years 11 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...
120
Voted
HAIS
2010
Springer
15 years 11 months ago
Graph-Based Model-Selection Framework for Large Ensembles
The intuition behind ensembles is that different prediciton models compensate each other’s errors if one combines them in an appropriate way. In case of large ensembles a lot of...
Krisztian Buza, Alexandros Nanopoulos, Lars Schmid...
ACL
2006
15 years 8 months ago
Graph Transformations in Data-Driven Dependency Parsing
Transforming syntactic representations in order to improve parsing accuracy has been exploited successfully in statistical parsing systems using constituency-based representations...
Jens Nilsson, Joakim Nivre, Johan Hall
NIPS
1997
15 years 8 months ago
Graph Matching with Hierarchical Discrete Relaxation
Our aim in this paper is to develop a Bayesian framework for matching hierarchical relational models. Such models are widespread in computer vision. The framework that we adopt fo...
Richard C. Wilson, Edwin R. Hancock
CORR
2006
Springer
127views Education» more  CORR 2006»
15 years 6 months ago
Approximating Rate-Distortion Graphs of Individual Data: Experiments in Lossy Compression and Denoising
Classical rate-distortion theory requires knowledge of an elusive source distribution. Instead, we analyze rate-distortion properties of individual objects using the recently devel...
Steven de Rooij, Paul M. B. Vitányi