Sciweavers

190 search results - page 15 / 38
» A Simple Proof Technique for Certain Parametricity Results
Sort
View
QSIC
2008
IEEE
14 years 1 months ago
Fault Localization with Non-parametric Program Behavior Model
Fault localization is a major activity in software debugging. Many existing statistical fault localization techniques compare feature spectra of successful and failed runs. Some a...
Peifeng Hu, Zhenyu Zhang, Wing Kwong Chan, T. H. T...
COMPGEOM
2003
ACM
14 years 24 days ago
Planar minimally rigid graphs and pseudo-triangulations
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
Ruth Haas, David Orden, Günter Rote, Francisc...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 2 months ago
Improved Approximation of Linear Threshold Functions
We prove two main results on how arbitrary linear threshold functions f(x) = sign(w · x − θ) over the n-dimensional Boolean hypercube can be approximated by simple threshold f...
Ilias Diakonikolas, Rocco A. Servedio
CVPR
2010
IEEE
14 years 3 months ago
Nonparametric Higher-Order Learning for Interactive Segmentation
In this paper, we deal with a generative model for multi-label, interactive segmentation. To estimate the pixel likelihoods for each label, we propose a new higher-order formulatio...
Tae Hoon Kim (Seoul National University), Kyoung M...
CIBCB
2006
IEEE
14 years 1 months ago
A Stochastic model to estimate the time taken for Protein-Ligand Docking
Abstract— Quantum mechanics and molecular dynamic simulation provide important insights into structural configurations and molecular interaction data today. To extend this atomi...
Preetam Ghosh, Samik Ghosh, Kalyan Basu, Sajal K. ...