TELSYS
2011
13 years 6 months ago
2011
GRASP (Greedy Randomized Adaptive Search Procedures) is a multistart metaheuristic for producing good-quality solutions of combinatorial optimization problems. Each GRASP iteration...
COLING
2010
13 years 6 months ago
2010
This paper describes a search procedure to discover optimal feature sets for dependency parsers. The search applies to the shift
CVPR
2011
IEEE
13 years 7 months ago
2011
IEEE
We propose a new learning method which exploits temporal consistency to successfully learn a complex appearance model from a sparsely labeled training video. Our approach consists...
DLOG
2009
13 years 9 months ago
2009
We present a novel reasoning procedure for Horn SHIQ ontologies--SHIQ ontologies that can be translated to the Horn fragment of first-order logic. In contrast to traditional reaso...
SIAMCOMP
2010
13 years 10 months ago
2010
We propose a general model of local property reconstruction. Suppose we have a function f on domain Γ, which is supposed to have a particular property P, but may not have the pro...
BIRTHDAY
2010
Springer
13 years 10 months ago
2010
Springer
Abstract. In the implementation of procedures, developers often assume that the input satisfies certain properties; for example, binary search assumes the array to be sorted. Such...
KES
2008
Springer
13 years 11 months ago
2008
Springer
An ontology for representing operation, safety and control procedures is proposed in this paper that supports diagnosis based on following these procedures and combining observed m...
NLE
2007
13 years 11 months ago
2007
We address the problem of extracting bilingual chunk pairs from parallel text to create training sets for statistical machine translation. We formulate the problem in terms of a s...
PRL
1998
13 years 11 months ago
1998
We present a computational, group-theoretic approach to steerable functions. The approach is group-theoretic in that the treatment involves continuous transformation groups for wh...
MP
2002
13 years 11 months ago
2002
In this paper we describe an automatic procedure for successively reducing the set of possible nonzeros in a Jacobian matrix until eventually the exact sparsity pattern is obtained...