Sciweavers

1299 search results - page 139 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
ICDT
2005
ACM
149views Database» more  ICDT 2005»
15 years 10 months ago
Approximately Dominating Representatives
We propose and investigate from the algorithmic standpoint a novel form of fuzzy query called approximately dominating representatives or ADRs. The ADRs of a multidimensional point...
Vladlen Koltun, Christos H. Papadimitriou
ECAI
2008
Springer
15 years 6 months ago
A Formal Approach for RDF/S Ontology Evolution
Abstract. In this paper, we consider the problem of ontology evolution in the face of a change operation. We devise a general-purpose algorithm for determining the effects and side...
George Konstantinidis, Giorgos Flouris, Grigoris A...
CVPR
1999
IEEE
15 years 8 months ago
Projective Rectification Without Epipolar Geometry
We present a novel algorithm performing projective rectification which does not require explicit computation of the epipolar geometry, and specifically of the fundamental matrix. ...
Francesco Isgrò, Emanuele Trucco
SGP
2007
15 years 6 months ago
As-rigid-as-possible surface modeling
Modeling tasks, such as surface deformation and editing, can be analyzed by observing the local behavior of the surface. We argue that defining a modeling operation by asking for ...
Olga Sorkine, Marc Alexa
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
15 years 11 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri