Sciweavers

975 search results - page 117 / 195
» Locality Optimization for Program Instances
Sort
View
CVPR
2004
IEEE
16 years 4 months ago
Shape Correspondence through Landmark Sliding
Motivated by improving statistical shape analysis, this paper presents a novel landmark-based method for accurate shape correspondence, where the general goal is to align multiple...
Song Wang, Toshiro Kubota, Theodor Richardson
130
Voted
ICARIS
2010
Springer
15 years 2 days ago
An Information-Theoretic Approach for Clonal Selection Algorithms
In this research work a large set of the classical numerical functions were taken into account in order to understand both the search capability and the ability to escape from a lo...
Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone, ...
127
Voted
POPL
2000
ACM
15 years 7 months ago
Type Systems for Distributed Data Structures
Distributed-memory programs are often written using a global address space: any process can name any memory location on any processor. Some languages completely hide the distincti...
Ben Liblit, Alexander Aiken
122
Voted
SIAMJO
2010
83views more  SIAMJO 2010»
15 years 1 months ago
The Lifted Newton Method and Its Application in Optimization
Abstract. We present a new “lifting” approach for the solution of nonlinear optimization problems (NLPs) that have objective and constraint functions with intermediate variable...
Jan Albersmeyer, Moritz Diehl
124
Voted
ECOOP
1998
Springer
15 years 7 months ago
Object-Oriented Architectural Support for a Java Processor
In this paper, we propose architectural support for object manipulation, stack processing and method invocation to enhance the execution speed of Java bytecodes. First, a virtual a...
Narayanan Vijaykrishnan, N. Ranganathan, Ravi Gade...