Sciweavers

835 search results - page 148 / 167
» Geometric Logic in Computer Science
Sort
View
TCS
2002
13 years 8 months ago
Set-sharing is redundant for pair-sharing
Although the usual goal of sharing analysis is to detect which pairs of variables share, the standard choice for sharing analysis is a domain that characterizes set-sharing. In th...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
CVPR
2006
IEEE
14 years 10 months ago
Image Matching Using Photometric Information
Image matching is an essential task in many computer vision applications. It is obvious that thorough utilization of all available information is critical for the success of match...
Michael Kolomenkin, Ilan Shimshoni
STACS
2010
Springer
14 years 3 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
SIGMOD
2001
ACM
158views Database» more  SIGMOD 2001»
14 years 8 months ago
Generating Efficient Plans for Queries Using Views
We study the problem of generating e cient, equivalent rewritings using views to compute the answer to a query. We take the closed-world assumption, in which views are materialize...
Foto N. Afrati, Chen Li, Jeffrey D. Ullman
EUSFLAT
2009
146views Fuzzy Logic» more  EUSFLAT 2009»
13 years 6 months ago
Opposite Fuzzy Sets with Applications in Image Processing
Diverse forms of the concept of opposition are already existent in philosophy, linguistics, psychology and physics. The interplay between entities and opposite entities is apparent...
Hamid R. Tizhoosh