Sciweavers

804 search results - page 47 / 161
» On the Termination of the Chase Algorithm
Sort
View
EUROGP
2005
Springer
15 years 6 months ago
Understanding Evolved Genetic Programs for a Real World Object Detection Problem
We describe an approach to understanding evolved programs for a real world object detection problem, that of finding orthodontic landmarks in cranio-facial X-Rays. The approach in...
Victor Ciesielski, Andrew Innes, Sabu John, John M...
CORR
2007
Springer
134views Education» more  CORR 2007»
15 years 13 days ago
A Partition-Based Relaxation For Steiner Trees
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph ...
Jochen Könemann, David Pritchard, Kunlun Tan
73
Voted
PODC
2010
ACM
15 years 4 months ago
Eventually linearizable shared objects
Linearizability is the strongest known consistency property of shared objects. In asynchronous message passing systems, Linearizability can be achieved with 3S and a majority of c...
Marco Serafini, Dan Dobre, Matthias Majuntke, P&ea...
119
Voted
JACM
2010
120views more  JACM 2010»
14 years 7 months ago
The structure of inverses in schema mappings
A schema mapping is a specification that describes how data structured under one schema (the source schema) is to be transformed into data structured under a different schema (the...
Ronald Fagin, Alan Nash
FOCS
2009
IEEE
15 years 7 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra