Sciweavers

305 search results - page 57 / 61
» Using Answer Sets to Solve Belief Change Problems
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
15 years 2 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
CGF
2005
94views more  CGF 2005»
14 years 9 months ago
Morphology-independent representation of motions for interactive human-like animation
This paper addresses the problem of human motion encoding for real-time animation in interactive environments. Classically, a motion is stored as a sequence of body postures encod...
Richard Kulpa, Franck Multon, Bruno Arnaldi
CASES
2008
ACM
14 years 11 months ago
Efficient vectorization of SIMD programs with non-aligned and irregular data access hardware
Automatic vectorization of programs for partitioned-ALU SIMD (Single Instruction Multiple Data) processors has been difficult because of not only data dependency issues but also n...
Hoseok Chang, Wonyong Sung
WABI
2010
Springer
178views Bioinformatics» more  WABI 2010»
14 years 7 months ago
Haplotype Inference on Pedigrees with Recombinations and Mutations
Abstract. Haplotype Inference (HI) is a computational challenge of crucial importance in a range of genetic studies, such as functional genomics, pharmacogenetics and population ge...
Yuri Pirola, Paola Bonizzoni, Tao Jiang
PR
2006
164views more  PR 2006»
14 years 9 months ago
Locally linear metric adaptation with application to semi-supervised clustering and image retrieval
Many computer vision and pattern recognition algorithms are very sensitive to the choice of an appropriate distance metric. Some recent research sought to address a variant of the...
Hong Chang, Dit-Yan Yeung