Sciweavers

2920 search results - page 47 / 584
» Finite information logic
Sort
View
ENTCS
2006
172views more  ENTCS 2006»
13 years 10 months ago
Locality of Queries and Transformations
Locality is a standard notion of finite model theory. There are two well known flavors of it, based on Hanf's and Gaifman's theorems. Essentially they say that structure...
Leonid Libkin
LATIN
1998
Springer
14 years 2 months ago
Shape Reconstruction with Delaunay Complex
The reconstruction of a shape or surface from a finite set of points is a practically significant and theoretically challenging problem. This paper presents a unified view of algor...
Herbert Edelsbrunner
CORR
2006
Springer
83views Education» more  CORR 2006»
13 years 10 months ago
Guessing under source uncertainty
This paper considers the problem of guessing the realization of a finite alphabet source when some side information is provided. The only knowledge the guesser has about the source...
Rajesh Sundaresan
FUIN
2000
71views more  FUIN 2000»
13 years 9 months ago
The Nondeterministic Information Logic NIL is PSPACE-complete
The nondeterministic information logic NIL has been introduced by Orlowska and Pawlak in 1984 as a logic for reasoning about total information systems with the similarity, the forw...
Stéphane Demri
SIGIR
1993
ACM
14 years 2 months ago
A Model of Information Retrieval Based on a Terminological Logic
According to the logical model of Information Retrieval (IR), the task of IR can be described as the extraction, from a given document base, of those documents d that, given a que...
Carlo Meghini, Fabrizio Sebastiani, Umberto Stracc...