3020 search results - page 144 / 604 » Optimal partition trees |
139
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we present a method to estimate the number of reconfiguration steps that a time-constrained algorithm can accommodate. This analysis demonstrates how one would attac...
180
click to vote
GFKL
2006
Springer
15 years 10 months ago
2006
Springer
In this paper we present an application of single cluster visualization (SCV) a technique to visualize single clusters of high-dimensional data. This method maps a single cluster t...
203
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...
206
click to vote
DAC
2008
ACM
16 years 7 months ago
2008
ACM
Embedded systems with heterogeneous processors extend the energy/timing trade-off flexibility and provide the opportunity to fine tune resource utilization for particular applicat...
154
click to vote
DATE
2007
IEEE
16 years 25 days ago
2007
IEEE
The integration of microprocessors and field-programmable gate array (FPGA) fabric on a single chip increases both the utility and necessity of tools that automatically move softw...