570 search results - page 18 / 114 » The Complexity of Reasoning with Global Constraints |
DLOG
2007
14 years 12 months ago
2007
We now know that the addition of a concept constructor called a Path Functional Dependency (PFD) to the Boolean-complete description logic DLF leads to undecidability of ABox consi...
106
click to vote
ACMICEC
2005
ACM
15 years 3 months ago
2005
ACM
In order to capture the full fledge semantic of complicated product data model, the expressive language ALCNHR+ K(D) is introduced. It cannot only be able to represent knowledge a...
CVPR
2006
IEEE
15 years 11 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...
61
Voted
FMCAD
2007
Springer
15 years 3 months ago
2007
Springer
—Embedded systems typically consist of a composition of a set of hardware and software IP modules. Each module is heavily optimized by itself. However, when these modules are com...
ICCV
2003
IEEE
15 years 11 months ago
2003
IEEE
Inspired by tensor voting, we present luminance voting, a novel approach for image registration with global and local luminance alignment. The key to our modeless approach is the ...