Sciweavers

694 search results - page 51 / 139
» Open Graphs and Computational Reasoning
Sort
View
ICCS
2007
Springer
14 years 4 months ago
Learning Common Outcomes of Communicative Actions Represented by Labeled Graphs
We build a generic methodology based on learning and reasoning to detect specific attitudes of human agents and patterns of their interactions. Human attitudes are determined in te...
Boris Galitsky, Boris Kovalerchuk, Sergei O. Kuzne...
ISMIS
2003
Springer
14 years 3 months ago
Similarity Graphs
Abstract. The focus of this paper is approaches to measuring similarity for application in content-based query evaluation. Rather than only comparing at the level of words, the iss...
Rasmus Knappe, Henrik Bulskov, Troels Andreasen
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 10 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
CVPR
2012
IEEE
12 years 18 days ago
Segmentation using superpixels: A bipartite graph partitioning approach
Grouping cues can affect the performance of segmentation greatly. In this paper, we show that superpixels (image segments) can provide powerful grouping cues to guide segmentation...
Zhenguo Li, Xiao-Ming Wu, Shih-Fu Chang
DAGSTUHL
2008
13 years 11 months ago
Constraint Satisfaction Problems with Infinite Templates
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
Manuel Bodirsky