4112 search results - page 484 / 823 » Efficient Algorithms for the Spoonerism Problem |
184
click to vote
SLIP
2009
ACM
16 years 2 months ago
2009
ACM
As technology advances, 3D ICs are introduced for alleviating the interconnect problem coming with shrinking feature size and increasing integration density. In 3D ICs, one of the...
247
click to vote
CPM
2006
Springer
15 years 11 months ago
2006
Springer
The Range-Minimum-Query-Problem is to preprocess an array such that the position of the minimum element between two specified indices can be obtained efficiently. We present a dire...
196
click to vote
EDBT
2000
ACM
15 years 11 months ago
2000
ACM
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
201
click to vote
NIPS
2004
15 years 9 months ago
2004
Most existing tracking algorithms construct a representation of a target object prior to the tracking task starts, and utilize invariant features to handle appearance variation of...
286
click to vote
JCO
2006
15 years 7 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...