594 search results - page 34 / 119 » Using Approximation to Relate Computational Classes over the... |
SIGMOD
2011
ACM
12 years 11 months ago
2011
ACM
An important means of allowing non-expert end-users to pose ad hoc queries — whether over single databases or data integration systems — is through keyword search. Given a set...
CSL
2010
Springer
13 years 9 months ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
RTS
2002
13 years 8 months ago
2002
As desktop computer computational power continues to increases dramatically, it is becoming commonplace to run a combination of deadline-sensitive applications. Despite the prolif...
ECCV
2002
Springer
14 years 10 months ago
2002
Springer
We address the problem of face recognition from a large set of images obtained over time - a task arising in many surveillance and authentication applications. A set or a sequence ...
PODC
1990
ACM
14 years 21 days ago
1990
ACM
Abstract. We introduce a novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible world. These val...