Sciweavers

Share
38 search results - page 3 / 8
» A random graph approach to NMR sequential assignment
Sort
View
ICPR
2002
IEEE
13 years 3 months ago
Relational Graph Labelling Using Learning Techniques and Markov Random Fields
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
Denis Rivière, Jean-Francois Mangin, Jean-M...
ICML
2004
IEEE
13 years 2 months ago
Semi-supervised learning using randomized mincuts
In many application domains there is a large amount of unlabeled data but only a very limited amount of labeled training data. One general approach that has been explored for util...
Avrim Blum, John D. Lafferty, Mugizi Robert Rweban...
DAC
1995
ACM
12 years 5 months ago
Register Allocation and Binding for Low Power
This paper describes a technique for calculating the switching activity of a set of registers shared by di erent data values. Based on the assumption that the joint pdf (probabili...
Jui-Ming Chang, Massoud Pedram
ICTAI
2006
IEEE
12 years 8 months ago
Outlier Detection Using Random Walks
The discovery of objects with exceptional behavior is an important challenge from a knowledge discovery standpoint and has attracted much attention recently. In this paper, we pre...
H. D. K. Moonesinghe, Pang-Ning Tan
ASPDAC
2010
ACM
135views Hardware» more  ASPDAC 2010»
12 years 23 hour ago
Statistical timing verification for transparently latched circuits through structural graph traversal
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
Xingliang Yuan, Jia Wang
books