32545 search results - page 350 / 6509 » Data Structures and Algorithms |
194
Voted
PPL
2010
15 years 1 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
213
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
This paper proposes a technique for constructing independent parameter tying structures of mean and variance in HMMbased speech synthesis. Conventionally, mean and variance parame...
170
click to vote
COMPGEOM
2003
ACM
16 years 1 days ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
144
click to vote
ICANN
2009
Springer
16 years 1 months ago
2009
Springer
Polychronization has been proposed as a possible way to investigate the notion of cell assemblies and to understand their role as memory supports for information coding. In a spiki...
135
click to vote
SIGECOM
2009
ACM
16 years 1 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...