Sciweavers

1236 search results - page 158 / 248
» On the Hamkins approximation property
Sort
View
ISAAC
2003
Springer
133views Algorithms» more  ISAAC 2003»
15 years 11 months ago
The Intractability of Computing the Hamming Distance
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
Bodo Manthey, Rüdiger Reischuk
FOCS
1989
IEEE
15 years 10 months ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan
CAV
2003
Springer
188views Hardware» more  CAV 2003»
15 years 10 months ago
Thread-Modular Abstraction Refinement
odular Abstraction Refinement Thomas A. Henzinger1 , Ranjit Jhala1 , Rupak Majumdar1 , and Shaz Qadeer2 1 University of California, Berkeley 2 Microsoft Research, Redmond Abstract....
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
BMCBI
2010
174views more  BMCBI 2010»
15 years 6 months ago
The effect of prior assumptions over the weights in BayesPI with application to study protein-DNA interactions from ChIP-based h
Background: To further understand the implementation of hyperparameters re-estimation technique in Bayesian hierarchical model, we added two more prior assumptions over the weight...
Junbai Wang
CORR
2008
Springer
141views Education» more  CORR 2008»
15 years 6 months ago
Truthful Unsplittable Flow for Large Capacity Networks
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
Yossi Azar, Iftah Gamzu, Shai Gutner