Sciweavers

1576 search results - page 281 / 316
» Properties of Synthetic Optimization Problems
Sort
View
SPAA
2006
ACM
14 years 3 months ago
Towards automatic parallelization of tree reductions in dynamic programming
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi
CSB
2005
IEEE
115views Bioinformatics» more  CSB 2005»
14 years 3 months ago
A New Clustering Strategy with Stochastic Merging and Removing Based on Kernel Functions
With hierarchical clustering methods, divisions or fusions, once made, are irrevocable. As a result, when two elements in a bottom-up algorithm are assigned to one cluster, they c...
Huimin Geng, Hesham H. Ali
CVPR
2005
IEEE
14 years 3 months ago
Robust Face Detection with Multi-Class Boosting
With the aim to design a general learning framework for detecting faces of various poses or under different lighting conditions, we are motivated to formulate the task as a classi...
Yen-Yu Lin, Tyng-Luh Liu
ICRA
2005
IEEE
122views Robotics» more  ICRA 2005»
14 years 3 months ago
Flocking with Obstacle Avoidance: A New Distributed Coordination Algorithm Based on Voronoi Partitions
— A new distributed coordination algorithm for multi-vehicle systems is presented in this paper. The algorithm combines a particular choice of navigation function with Voronoi pa...
Magnus Lindhé, Petter Ögren, Karl Henr...
IEEESCC
2005
IEEE
14 years 3 months ago
Web Service Discovery Based on Behavior Signatures
Web service discovery is a key problem as the number of services is expected to increase dramatically. Service discovery at the present time is based primarily on keywords, or int...
Zhongnan Shen, Jianwen Su