4155 search results - page 514 / 831 » Topic-Specific Optimization and Structuring |
180
click to vote
ESOP
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
183
click to vote
SIGMOD
1998
ACM
15 years 11 months ago
1998
ACM
Semistructured data is characterized by the lack of any fixed and rigid schema, although typically the data hassomeimplicitstructure. While thelack offixedschemamakesextracting ...
198
click to vote
INFOVIS
1997
IEEE
15 years 11 months ago
1997
IEEE
We present the H3 layout technique for drawing large directed graphs as node-link diagrams in 3D hyperbolic space. We can lay out much larger structures than can be handled using ...
221
click to vote
LICS
1997
IEEE
15 years 11 months ago
1997
IEEE
A subtyping 0 is entailed by a set of subtyping constraints C, written C j= 0, if every valuation (mapping of type variables to ground types) that satisfies C also satisfies 0. ...
246
click to vote
PODS
1997
ACM
15 years 11 months ago
1997
ACM
In this paper, we present a new cost model for nearest neighbor search in high-dimensional data space. We first analyze different nearest neighbor algorithms, present a generaliza...