2370 search results - page 142 / 474 » A Structured Set of Higher-Order Problems |
139
Voted
WCC
2005
Springer
15 years 9 months ago
2005
Springer
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
131
click to vote
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
Given a finite number of data points sampled from a low-dimensional manifold embedded in a high dimensional space together with the parameter vectors for a subset of the data poin...
130
Voted
STOC
2001
ACM
16 years 3 months ago
2001
ACM
We consider static one dimensional range searching problems. These problems are to build static data structures for an integer set S U, where U = {0, 1, . . . , 2w - 1}, which su...
133
Voted
HM
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper introduces a new algorithm, based on the concept of ejection chains, to effectively target vehicle routing problems with time window constraints (VRPTW). Ejec...
142
Voted
IJAR
2010
15 years 2 months ago
2010
We consider the problem of learning Bayesian network models in a non-informative setting, where the only available information is a set of observational data, and no background kn...