Sciweavers

105 search results - page 16 / 21
» Almost Optimal Solutions to k-Clustering Problems
Sort
View
MICCAI
2007
Springer
15 years 10 months ago
Shape Analysis Using a Point-Based Statistical Shape Model Built on Correspondence Probabilities
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
Heike Hufnagel, Xavier Pennec, Jan Ehrhardt, Heinz...
SAC
2010
ACM
14 years 9 months ago
Efficient mapping and voltage islanding technique for energy minimization in NoC under design constraints
Voltage islanding technique in Network-on-Chip (NoC) can significantly reduce the computational energy consumption by scaling down the voltage levels of the processing elements (P...
Pavel Ghosh, Arunabha Sen
ECOOPW
2006
Springer
15 years 1 months ago
Program Analysis for Security and Privacy
Abstract. Software security has become more important than ever. Unfortunately, still now, the security of a software system is almost always retrofitted to an afterthought. When s...
Marco Pistoia, Francesco Logozzo
CSR
2007
Springer
15 years 3 months ago
Maximal Intersection Queries in Randomized Graph Models
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
Benjamin Hoffmann, Yury Lifshits, Dirk Nowotka
CEC
2010
IEEE
14 years 10 months ago
Geometric Nelder-Mead Algorithm for the permutation representation
The Nelder-Mead Algorithm (NMA) is an almost half-century old method for numerical optimization, and it is a close relative of Particle Swarm Optimization (PSO) and Differential Ev...
Alberto Moraglio, Julian Togelius