Sciweavers

5606 search results - page 734 / 1122
» Randomization Techniques for Graphs.
Sort
View
220
Voted
PASTE
2010
ACM
15 years 12 months ago
Learning universal probabilistic models for fault localization
Recently there has been significant interest in employing probabilistic techniques for fault localization. Using dynamic dependence information for multiple passing runs, learnin...
Min Feng, Rajiv Gupta
EUROCAST
2007
Springer
159views Hardware» more  EUROCAST 2007»
15 years 10 months ago
Ant Colony Optimization for Model Checking
Abstract Model Checking is a well-known and fully automatic technique for checking software properties, usually given as temporal logic formulas on the program variables. Most of m...
Enrique Alba, J. Francisco Chicano
PSB
2004
15 years 8 months ago
Multiplexing Schemes for Generic SNP Genotyping Assays
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
Roded Sharan, Amir Ben-Dor, Zohar Yakhini
CGF
2011
14 years 10 months ago
Global Structure Optimization of Quadrilateral Meshes
We introduce a fully automatic algorithm which optimizes the high-level structure of a given quadrilateral mesh to achieve a coarser quadrangular base complex. Such a topological ...
David Bommes, Timm Lempfer, Leif Kobbelt
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 9 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu