749 search results - page 139 / 150 » Combinatory Models and Symbolic Computation |
152
click to vote
COMPGEOM
2003
ACM
15 years 9 months ago
2003
ACM
We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. De...
154
click to vote
FCT
2003
Springer
15 years 9 months ago
2003
Springer
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
176
Voted
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
129
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This research screens the tuning parameters of a combinatorial optimization heuristic. Specifically, it presents a Design of Experiments (DOE) approach that uses a Fractional Fac...
139
Voted
COMBINATORICA
2008
15 years 4 months ago
2008
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...