1615 search results - page 204 / 323 » Computer science and decision theory |
188
click to vote
FOCS
2003
IEEE
16 years 5 days ago
2003
IEEE
We show that Yao’s XOR Lemma, and its essentially equivalent rephrasing as a Direct Product Lemma, can be re-interpreted as a way of obtaining error-correcting codes with good l...
176
click to vote
FOCS
2002
IEEE
15 years 12 months ago
2002
IEEE
We obtain a near-tight bound of O(n3+ε ), for any ε > 0, on the complexity of the overlay of the minimization diagrams of two collections of surfaces in four dimensions. This...
176
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Given an undirected multigraph G and a subset of vertices S V (G), the STEINER TREE PACKING problem is to find a largest collection of edge-disjoint trees that each connects S. T...
195
click to vote
GG
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
240
click to vote
GG
2008
Springer
15 years 8 months ago
2008
Springer
Behavior preservation, namely the fact that the behavior of a model is not altered by the transformations, is a crucial property in refactoring. The most common approaches to behav...