Sciweavers

2490 search results - page 130 / 498
» Complexity of Contextual Reasoning
Sort
View
STOC
2005
ACM
130views Algorithms» more  STOC 2005»
16 years 4 months ago
From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
CCIA
2007
Springer
15 years 10 months ago
Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques
With the arrival of high throughput genotyping techniques, the detection of likely genotyping errors is becoming an increasingly important problem. In this paper we are interested...
Martí Sánchez, Simon de Givry, Thoma...
SIAMCOMP
2011
14 years 11 months ago
The Complexity of Early Deciding Set Agreement
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
Eli Gafni, Rachid Guerraoui, Bastian Pochon
LPAR
2010
Springer
15 years 2 months ago
On the Satisfiability of Two-Variable Logic over Data Words
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
Claire David, Leonid Libkin, Tony Tan
GIS
2009
ACM
16 years 5 months ago
Augmenting Cartographic Resources for Autonomous Driving
In this paper we present algorithms for automatically generating a road network description from aerial imagery. The road network inforamtion (RNI) produced by our algorithm inclu...
Young-Woo Seo, Chris Urmson, David Wettergreen Ji...