Sciweavers

184 search results - page 12 / 37
» A New Algorithm of Constructing the Basis Finite Automaton
Sort
View
JSYML
2008
74views more  JSYML 2008»
13 years 8 months ago
Omitting types for finite variable fragments and complete representations of algebras
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
Tarek Sayed Ahmed, Hajnal Andréka, Istv&aac...
ICCV
2001
IEEE
14 years 10 months ago
Reconstructing Surfaces Using Anisotropic Basis Functions
Point sets obtained from computer vision techniques are often noisy and non-uniform. We present a new method of surface reconstruction that can handle such data sets using anisotr...
Huong Quynh Dinh, Greg Turk, Gregory G. Slabaugh
EH
2005
IEEE
123views Hardware» more  EH 2005»
14 years 2 months ago
Embryonic Machines That Grow, Self-Replicate and Self-Repair
After a reminder about embryonic machines endowed with universal construction and universal computation properties, this paper presents a novel architecture providing additional s...
André Stauffer, Daniel Mange, Gianluca Temp...
DLOG
2007
13 years 11 months ago
Blocking Automata for PSPACE DLs
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
Franz Baader, Jan Hladik, Rafael Peñaloza
AMAI
2008
Springer
13 years 8 months ago
The giving tree: constructing trees for efficient offline and online multi-robot coverage
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
Noa Agmon, Noam Hazon, Gal A. Kaminka