544 search results - page 30 / 109 » What cannot be computed locally! |
PPSN
2004
Springer
14 years 2 months ago
2004
Springer
Current Genetic Algorithms can efficiently address order-k separable problems, in which the order of the linkage is restricted to a low value k. Outside this class, there exist hie...
IPPS
1998
IEEE
14 years 27 days ago
1998
IEEE
Parallel programming continues to be difficult and error-prone, whether starting from specifications or from an existing sequential program. This paper presents (1) a methodology f...
RTA
2010
Springer
13 years 7 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and...
MICRO
2006
IEEE
14 years 2 months ago
2006
IEEE
Instruction aggregation—the grouping of multiple operations into a single processing unit—is a technique that has recently been used to amplify the bandwidth and capacity of c...
ICIP
2001
IEEE
14 years 10 months ago
2001
IEEE
In this paper we address the problem of registering 3D scattered data by the mean of a statistical shape model. This model is built from a training set on which a principal compon...