10146 search results - page 346 / 2030 » Fast FAST |
171
click to vote
WG
2009
Springer
16 years 1 months ago
2009
Springer
The Hamiltonian Cycle problem asks if an n-vertex graph G has a cycle passing through all vertices of G. This problem is a classic NP-complete problem. So far, finding an exact al...
178
click to vote
ARCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper we present a partial bitstreams ultra-fast downloading process through a standard Ethernet network. These Virtex-based and partially reconfigurable systems...
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
154
click to vote
CAIP
2009
Springer
16 years 1 months ago
2009
Springer
This paper compares the original implementation of the trilateral filter with two proposed speed improvements. One is using simple look-up-tables, and leads to exactly the same re...
155
click to vote
CIKM
2009
Springer
16 years 1 months ago
2009
Springer
Histogram construction or sequence segmentation is a basic task with applications in database systems, information retrieval, and knowledge management. Its aim is to approximate a...