Sciweavers

502 search results - page 81 / 101
» Learning from General Label Constraints
Sort
View
CP
2006
Springer
14 years 10 days ago
A New Algorithm for Sampling CSP Solutions Uniformly at Random
The paper presents a method for generating solutions of a constraint satisfaction problem (CSP) uniformly at random. The main idea is to express the CSP as a factored probability d...
Vibhav Gogate, Rina Dechter
ICCV
2005
IEEE
14 years 2 months ago
Robust Point Matching for Two-Dimensional Nonrigid Shapes
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
Yefeng Zheng, David S. Doermann
LICS
2010
IEEE
13 years 7 months ago
Weak Equivalences in Psi-Calculi
Psi-calculi extend the pi-calculus with nominal datatypes to represent data, communication channels, and logics for facts and conditions. This general framework admits highly expr...
Magnus Johansson, Jesper Bengtson, Joachim Parrow,...
CVPR
2009
IEEE
15 years 4 months ago
Recognizing Linked Events: Searching the Space of Feasible Explanations
The ambiguity inherent in a localized analysis of events from video can be resolved by exploiting constraints between events and examining only feasible global explanations. We sho...
Dima Damen (University of Leeds), David Hogg (Univ...
BSN
2006
IEEE
131views Sensor Networks» more  BSN 2006»
14 years 2 months ago
Elaborating Sensor Data using Temporal and Spatial Commonsense Reasoning
Ubiquitous computing has established a vision of computation where computers are so deeply integrated into our lives that they become both invisible and everywhere. In order to ha...
Bo Morgan, Push Singh