Sciweavers

1964 search results - page 58 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
ICIP
2005
IEEE
14 years 9 months ago
Visual tracking using sequential importance sampling with a state partition technique
Sequential importance sampling (SIS), also known as particle filtering, has drawn increasing attention recently due to its superior performance in nonlinear and non-Gaussian dynam...
Yan Zhai, Mark B. Yeary, Joseph P. Havlicek, Jean-...
AIEDAM
2007
90views more  AIEDAM 2007»
13 years 8 months ago
Assembly synthesis with subassembly partitioning for optimal in-process dimensional adjustability
Achieving the dimensional integrity for a complex structural assembly is a demanding task due to the manufacturing variations of parts and the tolerance relationship between them....
Byungwoo Lee, Kazuhiro Saitou
WAOA
2007
Springer
158views Algorithms» more  WAOA 2007»
14 years 1 months ago
Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
We consider ranking and clustering problems related to the aggregation of inconsistent information. Ailon, Charikar, and Newman [1] proposed randomized constant factor approximatio...
Anke van Zuylen, David P. Williamson
JAIR
2007
141views more  JAIR 2007»
13 years 7 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
13 years 7 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev