2124 search results - page 90 / 425 » Repairing Structurally Complex Data |
122
click to vote
SMA
2005
ACM
15 years 7 months ago
2005
ACM
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
117
click to vote
VLDB
1997
ACM
15 years 6 months ago
1997
ACM
Query optimizers that explore a search space exhaustively using transformation rules usually apply all possible rules on each alternative, and stop when no new information is prod...
118
click to vote
COLING
1996
15 years 3 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
121
click to vote
CAD
2005
Springer
15 years 2 months ago
2005
Springer
Since the publication of the original Marching Cubes algorithm, numerous variations have been proposed for guaranteeing water-tight constructions of triangulated approximations of...
126
click to vote
BMCBI
2004
15 years 2 months ago
2004
Background: Protein-protein interactions play a critical role in protein function. Completion of many genomes is being followed rapidly by major efforts to identify interacting pr...