Sciweavers

7259 search results - page 87 / 1452
» From Fields to Trees
Sort
View
IS
2008
13 years 8 months ago
Efficient memory representation of XML document trees
Implementations that load XML documents and give access to them via, e.g., the DOM, suffer from huge memory demands: the space needed to load an XML document is usually many times...
Giorgio Busatto, Markus Lohrey, Sebastian Maneth
ASC
2008
13 years 8 months ago
Morphic computing
Morphic Computing is based on Field Theory [14-16] and more specifically Morphic Fields. Morphic Fields were first introduced by [18] from his hypothesis of formative causation tha...
Germano Resconi, Masoud Nikravesh
ICIP
2000
IEEE
14 years 9 months ago
Reduction of Inherent Ambiguities in Structure from Motion Problem Using Inertial Data
In thispapel; the reduction of inherent ambiguities in StructurefromMotion(SW)using inertialdata isaddressed. First, we show that the translation-rotation ambiguity inS'from ...
Gang Qian, Qinfen Zheng, Rama Chellappa
DAM
2010
107views more  DAM 2010»
13 years 8 months ago
Codes from lattice and related graphs, and permutation decoding
Codes of length n2 and dimension 2n - 1 or 2n - 2 over the field Fp, for any prime p, that can be obtained from designs associated with the complete bipartite graph Kn,n and its l...
Jennifer D. Key, Bernardo Gabriel Rodrigues
ICCAD
1996
IEEE
112views Hardware» more  ICCAD 1996»
14 years 10 days ago
GRASP - a new search algorithm for satisfiability
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed searchp...
João P. Marques Silva, Karem A. Sakallah