4894 search results - page 468 / 979 » The Guarding Problem - Complexity and Approximation |
170
click to vote
ALGORITHMICA
2011
15 years 1 months ago
2011
A nonplanar graph G is near-planar if it contains an edge e such that G−e is planar. The problem of determining the crossing number of a near-planar graph is exhibited from diffe...
240
Voted
ACCV
2010
Springer
15 years 1 months ago
2010
Springer
Detecting instances of unknown categories is an important task for a multitude of problems such as object recognition, event detection, and defect localization. This paper investig...
155
click to vote
COLING
2010
15 years 1 months ago
2010
Model minimization has been shown to work well for the task of unsupervised part-of-speech tagging with a dictionary. In (Ravi and Knight, 2009), the authors invoke an integer pro...
160
Voted
MOC
2011
15 years 1 months ago
2011
Abstract. Local energy error estimates for the finite element method for elliptic problems were originally proved in 1974 by Nitsche and Schatz. These estimates show that the loca...
123
click to vote
JCAM
2010
15 years 29 days ago
2010
Asian options, basket options and spread options have been extensively studied in literature. However, few papers deal with the problem of pricing general Asian basket spread opti...