Sciweavers

1022 search results - page 94 / 205
» Logspace Complexity of Functions and Structures
Sort
View
GECCO
2007
Springer
137views Optimization» more  GECCO 2007»
15 years 4 months ago
Extended probe method for linkage discovery over high-cardinality alphabets
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
Shude Zhou, Zengqi Sun, Robert B. Heckendorn
CVPR
2000
IEEE
15 years 2 months ago
Corner Guided Curve Matching and its Application to Scene Reconstruction
Corners and curves are important image features in many vision-based applications. Corners are usually more stable and easier to match than curves,while curves contain richer info...
Ying Shan, Zhengyou Zhang
JCB
2008
108views more  JCB 2008»
14 years 10 months ago
Asymptotics of RNA Shapes
Abstract. RNA shapes, introduced by Giegerich et al. (17), provide a useful classification of the branching complexity for RNA secondary structures. In this paper, we derive an exa...
W. A. Lorenz, Yann Ponty, Peter Clote
APVIS
2010
14 years 5 months ago
Visual analysis of high dimensional point clouds using topological landscapes
In this paper, we present a novel three-stage process to visualize the structure of point clouds in arbitrary dimensions. To get insight into the structure and complexity of a dat...
Patrick Oesterling, Christian Heine, Heike Jä...
PLDI
2011
ACM
14 years 24 days ago
Data representation synthesis
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...