790 search results - page 46 / 158 » Subexponential Parameterized Algorithms |
126
Voted
COMPGEOM
1993
ACM
15 years 6 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
121
click to vote
SIAMCOMP
2008
15 years 2 months ago
2008
![Resolution Is Not Automatizable Unless W[P] Is Tractable](https://sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Resolution Is Not Automatizable Unless W[P] Is Tractable")
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
115
Voted
INLG
2010
Springer
15 years 14 days ago
2010
Springer
The problem of Named Entity Generation is expressed as a conditional probability model over a structured domain. By defining a factor-graph model over the mentions of a text, we o...
113
Voted
CVPR
1998
IEEE
16 years 4 months ago
1998
IEEE
In previous work [14], we modify the hidden Markov model (HMM) framework to incorporate a global parametric variation in the output probabilities of the states of the HMM. Develop...
94
Voted
CVPR
2008
IEEE
16 years 4 months ago
2008
IEEE
When rotating a pinhole camera, images are related by the infinite homography KRK-1 , which is algebraically a conjugate rotation. Although being a very common image transformatio...