Sciweavers

2553 search results - page 205 / 511
» Modeling Trees with Hypertextures
Sort
View
SIAMSC
2011
140views more  SIAMSC 2011»
14 years 6 months ago
A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calcu
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...
Lin Lin, Chao Yang, Jianfeng Lu, Lexing Ying, Wein...
AAAI
2011
14 years 4 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
CVPR
2012
IEEE
13 years 6 months ago
Parameter-free/Pareto-driven procedural 3D reconstruction of buildings from ground-level sequences
In this paper we address multi-view reconstruction of urban environments using 3D shape grammars. Our formulation expresses the solution to the problem as a shape grammar parse tr...
Loïc Simon, Olivier Teboul, Panagiotis Koutso...
ACL
2001
15 years 5 months ago
What is the Minimal Set of Fragments that Achieves Maximal Parse Accuracy?
We aim at finding the minimal set of fragments which achieves maximal parse accuracy in Data Oriented Parsing. Experiments with the Penn Wall Street Journal treebank show that cou...
Rens Bod
EACL
2003
ACL Anthology
15 years 5 months ago
Well-Nested Parallelism Constraints for Ellipsis Resolution
The Constraint Language for Lambda Structures (CLLS) is an expressive tree description language. It provides a uniform framework for underspecified semantics, covering scope, ell...
Katrin Erk, Joachim Niehren