Sciweavers

1024 search results - page 40 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
UIST
2009
ACM
15 years 4 months ago
Perceptual interpretation of ink annotations on line charts
Asynchronous collaborators often use freeform ink annotations to point to visually salient perceptual features of line charts such as peaks or humps, valleys, rising slopes and de...
Nicholas Kong, Maneesh Agrawala
SMI
2006
IEEE
135views Image Analysis» more  SMI 2006»
15 years 3 months ago
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
Bruno Lévy
CAV
2012
Springer
231views Hardware» more  CAV 2012»
13 years 6 days ago
Incremental, Inductive CTL Model Checking
A SAT-based incremental, inductive algorithm for model checking CTL properties is proposed. As in classic CTL model checking, the parse graph of the property shapes the analysis. H...
Zyad Hassan, Aaron R. Bradley, Fabio Somenzi
CORR
2004
Springer
124views Education» more  CORR 2004»
14 years 9 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
ACL
2008
14 years 11 months ago
Unsupervised Discovery of Generic Relationships Using Pattern Clusters and its Evaluation by Automatically Generated SAT Analogy
We present a novel framework for the discovery and representation of general semantic relationships that hold between lexical items. We propose that each such relationship can be ...
Dmitry Davidov, Ari Rappoport