Sciweavers

5592 search results - page 34 / 1119
» On Random Betweenness Constraints
Sort
View
ICASSP
2011
IEEE
13 years 1 months ago
Exploiting an interplay between norms to analyze scalar quantization schemes
Quantization is intrinsic to several data acquisition systems. This process is especially important in distributed settings, where observations must rst be compressed before they ...
Parimal Parag, Jean-François Chamberland
FDL
2008
IEEE
14 years 4 months ago
Contradiction Analysis for Constraint-based Random Simulation
Constraint-based random simulation is state-of-the-art in verification of multi-million gate industrial designs. This method is based on stimulus generation by constraint solving...
Daniel Große, Robert Wille, Robert Siegmund,...
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
14 years 10 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
SIGMOD
2011
ACM
205views Database» more  SIGMOD 2011»
13 years 21 days ago
Interaction between record matching and data repairing
Central to a data cleaning system are record matching and data repairing. Matching aims to identify tuples that refer to the same real-world object, and repairing is to make a dat...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Weny...
AAAI
1994
13 years 11 months ago
In Search of the Best Constraint Satisfaction Search
We present the results of an empirical study of several constraint satisfaction search algorithms and heuristics. Using a random problem generator that allows us to create instanc...
Daniel Frost, Rina Dechter