Sciweavers

511 search results - page 22 / 103
» More Precise Partition Abstractions
Sort
View
CORR
2007
Springer
77views Education» more  CORR 2007»
13 years 8 months ago
On the interaction between sharing and linearity
nalysis of logic programs, abstract domains for detecting sharing and linearity ion are widely used. Devising abstract unification algorithms for such domains has proved to be ra...
Gianluca Amato, Francesca Scozzari
PLDI
2006
ACM
14 years 2 months ago
Correctness-preserving derivation of concurrent garbage collection algorithms
Constructing correct concurrent garbage collection algorithms is notoriously hard. Numerous such algorithms have been proposed, implemented, and deployed – and yet the relations...
Martin T. Vechev, Eran Yahav, David F. Bacon
ICDE
2010
IEEE
235views Database» more  ICDE 2010»
14 years 8 months ago
Cost-efficient and Differentiated Data Availability Guarantees in Data Clouds
Abstract-- Failures of any type are common in current datacenters. As data scales up, its availability becomes more complex, while different availability levels per application or ...
Nicolas Bonvin, Thanasis G. Papaioannou, Karl Aber...
TIP
2008
125views more  TIP 2008»
13 years 8 months ago
Segmentation by Fusion of Histogram-Based K-Means Clusters in Different Color Spaces
Abstract--This paper presents a new, simple, and efficient segmentation approach, based on a fusion procedure which aims at combining several segmentation maps associated to simple...
Max Mignotte
COLT
2003
Springer
14 years 2 months ago
Learning with Equivalence Constraints and the Relation to Multiclass Learning
Abstract. We study the problem of learning partitions using equivalence constraints as input. This is a binary classification problem in the product space of pairs of datapoints. ...
Aharon Bar-Hillel, Daphna Weinshall