Sciweavers

8413 search results - page 222 / 1683
» Ordering Problem Subgoals
Sort
View
MOR
2008
98views more  MOR 2008»
15 years 21 days ago
An Analysis of Monotone Follower Problems for Diffusion Processes
We consider a singular stochastic control problem, which is called the Monotone Follower Stochastic Control Problem and give sufficient conditions for the existence and uniqueness...
Erhan Bayraktar, Masahiko Egami
STOC
2010
ACM
216views Algorithms» more  STOC 2010»
15 years 10 months ago
The HOM problem is decidable
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
Guillem Godoy, Omer Giménez, Lander Ramos and Car...
113
Voted
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
15 years 6 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
15 years 10 months ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
110
Voted
CVPR
2007
IEEE
15 years 7 months ago
A Graph Reduction Method for 2D Snake Problems
Energy-minimizing active contour models (snakes) have been proposed for solving many computer vision problems such as object segmentation, surface reconstruction, and object track...
Jianhua Yan, Keqi Zhang, Chengcui Zhang, Shu-Ching...