Sciweavers

2517 search results - page 53 / 504
» Specifying Weak Sets
Sort
View
COR
2006
122views more  COR 2006»
14 years 12 months ago
Experimental Analysis of Approximation Algorithms for the Vertex Cover and Set Covering Problems
Several approximation algorithms with proven performance guarantees have been proposed to find approximate solutions to classical combinatorial optimization problems. However, the...
Fernando C. Gomes, Cláudio Nogueira de Mene...
CORR
2011
Springer
149views Education» more  CORR 2011»
14 years 6 months ago
Solving k-Set Agreement with Stable Skeleton Graphs
In this paper we consider the k-set agreement problem in distributed round-based systems where processes communicate by message passing. We capture the synchrony and reliability o...
Martin Biely, Peter Robinson, Ulrich Schmid
GEOINFORMATICA
2006
102views more  GEOINFORMATICA 2006»
14 years 12 months ago
Mining Co-Location Patterns with Rare Events from Spatial Data Sets
Abstract A co-location pattern is a group of spatial features/events that are frequently co-located in the same region. For example, human cases of West Nile Virus often occur in r...
Yan Huang, Jian Pei, Hui Xiong
CAV
2006
Springer
80views Hardware» more  CAV 2006»
15 years 3 months ago
Don't Care Words with an Application to the Automata-Based Approach for Real Addition
d Abstract) Jochen Eisinger1 and Felix Klaedtke2 1 Albert-Ludwigs-Universit
Jochen Eisinger, Felix Klaedtke
CALCO
2005
Springer
98views Mathematics» more  CALCO 2005»
15 years 5 months ago
The Least Fibred Lifting and the Expressivity of Coalgebraic Modal Logic
Every endofunctor B on the category Set can be lifted to a fibred functor on the category (fibred over Set) of equivalence relations and relation-preserving functions. In this pa...
Bartek Klin