Sciweavers

971 search results - page 110 / 195
» Approximate Satisfiability and Equivalence
Sort
View
99
Voted
JANCL
2008
170views more  JANCL 2008»
15 years 23 days ago
Algorithmic correspondence and completeness in modal logic
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
Willem Conradie, Valentin Goranko
LOGCOM
2008
106views more  LOGCOM 2008»
15 years 22 days ago
Reinforcement Belief Revision
The capability of revising its beliefs upon new information in a rational and efficient way is crucial for an intelligent agent. The classical work in belief revision focuses on i...
Yi Jin, Michael Thielscher
106
Voted
SIGIR
2008
ACM
15 years 21 days ago
Optimizing relevance and revenue in ad search: a query substitution approach
The primary business model behind Web search is based on textual advertising, where contextually relevant ads are displayed alongside search results. We address the problem of sel...
Filip Radlinski, Andrei Z. Broder, Peter Ciccolo, ...
112
Voted
IJCV
2007
138views more  IJCV 2007»
15 years 21 days ago
Correspondence-free Structure from Motion
We present a novel approach for the estimation of 3D-motion directly from two images using the Radon transform. The feasibility of any camera motion is computed by integrating over...
Ameesh Makadia, Christopher Geyer, Kostas Daniilid...
TCAD
2002
115views more  TCAD 2002»
15 years 12 days ago
Analytical models for crosstalk excitation and propagation in VLSI circuits
We develop a general methodology to analyze crosstalk effects that are likely to cause errors in deep submicron high speed circuits. We focus on crosstalk due to capacitive coupli...
Wei-Yu Chen, Sandeep K. Gupta, Melvin A. Breuer