Sciweavers

2157 search results - page 339 / 432
» Binary ant algorithm
Sort
View
124
Voted
3DPVT
2006
IEEE
257views Visualization» more  3DPVT 2006»
15 years 8 months ago
3D from Line Segments in Two Poorly-Textured, Uncalibrated Images
This paper addresses the problem of camera selfcalibration, bundle adjustment and 3D reconstruction from line segments in two images of poorly-textured indoor scenes. First, we ge...
Herbert Bay, Andreas Ess, Alexander Neubeck, Luc J...
ICPADS
2006
IEEE
15 years 8 months ago
Memory and Network Bandwidth Aware Scheduling of Multiprogrammed Workloads on Clusters of SMPs
Symmetric Multiprocessors (SMPs), combined with modern interconnection technologies are commonly used to build cost-effective compute clusters. However, contention among processor...
Evangelos Koukis, Nectarios Koziris
110
Voted
SIGIR
2006
ACM
15 years 8 months ago
Feature diversity in cluster ensembles for robust document clustering
The performance of document clustering systems depends on employing optimal text representations, which are not only difficult to determine beforehand, but also may vary from one ...
Xavier Sevillano, Germán Cobo, Francesc Al&...
122
Voted
APCSAC
2005
IEEE
15 years 8 months ago
A Fault-Tolerant Routing Strategy for Fibonacci-Class Cubes
Fibonacci Cubes (FCs), together with the enhanced and extended forms, are a family of interconnection topologies formed by diluting links from binary hypercube. While they scale up...
Zhang Xinhua, Peter Loh
109
Voted
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
15 years 8 months ago
A Lower Bound on List Size for List Decoding
A q-ary error-correcting code C ⊆ {1, 2, . . . , q}n is said to be list decodable to radius ρ with list size L if every Hamming ball of radius ρ contains at most L codewords o...
Venkatesan Guruswami, Salil P. Vadhan