4112 search results - page 75 / 823 » Efficient Algorithms for the Spoonerism Problem |
143
click to vote
MOBIHOC
2004
ACM
16 years 3 months ago
2004
ACM
We propose several novel localized algorithms to construct energy efficient routing structures for homogeneous wireless ad hoc networks, where all nodes have same maximum transmis...
142
click to vote
AUSAI
2010
Springer
15 years 1 months ago
2010
Springer
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
131
click to vote
IOR
2010
15 years 1 months ago
2010
Reliable risk measurement is a key problem for financial institutions and regulatory authorities. The current industry standard Value-at-Risk has several deficiencies. Improved ri...
140
click to vote
TSMC
2010
14 years 10 months ago
2010
We present an adaptive framework for condensation algorithms in the context of human-face tracking. We attack the face tracking problem by making factored sampling more efficient a...
280
click to vote
GECCO
2011
Springer
14 years 7 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...