Sciweavers

3280 search results - page 347 / 656
» MiTAP for real users, real data, real problems
Sort
View
WOB
2003
140views Bioinformatics» more  WOB 2003»
15 years 8 months ago
Computing Maximum Subsequence in Parallel
The maximum subsequence problem finds the contiguous subsequence of n real numbers with the highest sum. This is an important problem that arises in several contexts in Computatio...
Carlos E. R. Alves, Edson Cáceres, Siang W....
IJVR
2008
111views more  IJVR 2008»
15 years 6 months ago
Improve a Game Board based on Cultural Algorithms
Evolutionary computation is a generic term used to make reference to the solution of computational problems planned and implemented based on models of an evolutionary process. Most...
Alberto Ochoa, Alejandro Padilla, Saúl Gonz...
PERCOM
2010
ACM
15 years 5 months ago
Concurrent scheduling in the Active Bat location system
Abstract—This paper looks at the scalability problems inherent in the Active Bat system: an outside-in ultrasonic location system. Such systems are typically associated with high...
Oliver Woodman, Robert Harle
PAMI
2011
15 years 1 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
SAC
2010
ACM
15 years 1 months ago
Convex onion peeling genetic algorithm: an efficient solution to map labeling of point-feature
Map labeling of point-feature is the problem of placing text labels to corresponding point features on a map in a way that minimizes overlaps while satisfying basic rules for the ...
Wan D. Bae, Shayma Alkobaisi, Petr Vojtechovsk&yac...