Sciweavers

1307 search results - page 240 / 262
» Follow the intellectual property
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 1 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
TAPSOFT
1993
Springer
15 years 1 months ago
Exception Handling and Term Labelling
: We propose a new algebraic framework for exception handling which is powerful enough to cope with many exception handling features such that recovery, implicit propagation of exc...
Gilles Bernot, Pascale Le Gall
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
15 years 1 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
64
Voted
ICALP
1989
Springer
15 years 1 months ago
Causal Trees
Category theory has been successfully employed to structure the confusing setup of models and equivalences for concurrency: Winskel and Nielsen have related the standard models nc...
Philippe Darondeau, Pierpaolo Degano
MPC
2010
Springer
174views Mathematics» more  MPC 2010»
15 years 1 months ago
Matrices as Arrows!
cting programs and point-free abstraction [2]. In order to automatically generate the fast running code there was the need to use matrix product as the basic matrix composition ope...
Hugo Daniel Macedo, José Nuno Oliveira