544 search results - page 30 / 109 » What cannot be computed locally! |
120
Voted
PPSN
2004
Springer
15 years 9 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...
128
Voted
IPPS
1998
IEEE
15 years 8 months 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...
129
Voted
RTA
2010
Springer
15 years 2 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...
100
Voted
MICRO
2006
IEEE
15 years 9 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...
152
Voted
ICIP
2001
IEEE
16 years 5 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...