Sciweavers

4047 search results - page 422 / 810
» The Discrete Basis Problem
Sort
View
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
15 years 10 months ago
Fast Analytic Placement using Minimum Cost Flow
Many current integrated circuits designs, such as those released for the ISPD2005[14] placement contest, are extremely large and can contain a great deal of white space. These new...
Ameya R. Agnihotri, Patrick H. Madden
CDC
2009
IEEE
157views Control Systems» more  CDC 2009»
15 years 10 months ago
A PDE viewpoint on basic properties of coordination algorithms with symmetries
Several recent control applications consider the coordination of subsystems through local interaction. Often the interaction has a symmetry in state space, e.g. invariance with res...
Alain Sarlette, Rodolphe Sepulchre
ECML
2007
Springer
15 years 10 months ago
Efficient Computation of Recursive Principal Component Analysis for Structured Input
Recently, a successful extension of Principal Component Analysis for structured input, such as sequences, trees, and graphs, has been proposed. This allows the embedding of discret...
Alessandro Sperduti
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
15 years 10 months ago
Understanding particle swarms through simplification: a study of recombinant PSO
Simplified forms of the particle swarm algorithm are very beneficial in contributing to understanding of what makes a PSO swarm function in the way that it does. One of these form...
Daniel Bratton, Tim Blackwell
AINA
2004
IEEE
15 years 10 months ago
Secret Sharing with Access Structures in a Hierarchy
2004, Chang et al. suggested an approach that solves the problem of secret sharing with access structures in a hierarchy. They used the concept of discrete logarithmto reuse shado...
Chin-Chen Chang, Chu-Hsing Lin, Wei Lee, Pai-Cheng...