Sciweavers

5606 search results - page 216 / 1122
» Randomization Techniques for Graphs.
Sort
View
105
Voted
IFIP
2001
Springer
15 years 5 months ago
Random Adjacent Sequences: An Efficient Solution for Logic BIST
: High defect coverage requires good coverage of different fault types. In this paper, we present a comprehensive test vector generation technique for BIST, called Random Single In...
René David, Patrick Girard, Christian Landr...
143
Voted
ICRA
1995
IEEE
188views Robotics» more  ICRA 1995»
15 years 4 months ago
Fast Approximation of Range Images by Triangular Meshes Generated through Adaptive Randomized Sampling
This paper describes and evaluates an efficient technique that allows the fast generation of 3D triangular meshes from range images avoiding optimization procedures. Such a tool ...
Miguel Angel García
UAI
2000
15 years 2 months ago
Utilities as Random Variables: Density Estimation and Structure Discovery
Decision theory does not traditionally include uncertainty over utility functions. We argue that the a person's utility value for a given outcome can be treated as we treat o...
Urszula Chajewska, Daphne Koller
106
Voted
NAACL
2007
15 years 2 months ago
Data-Driven Graph Construction for Semi-Supervised Graph-Based Learning in NLP
Graph-based semi-supervised learning has recently emerged as a promising approach to data-sparse learning problems in natural language processing. All graph-based algorithms rely ...
Andrei Alexandrescu, Katrin Kirchhoff
VLDB
2012
ACM
361views Database» more  VLDB 2012»
13 years 8 months ago
Answering pattern match queries in large graph databases via graph embedding
The growing popularity of graph databases has generated interesting data management problems, such as subgraph search, shortest path query, reachability verification, and pattern ...
Lei Zou, Lei Chen 0002, M. Tamer Özsu, Dongya...