Sciweavers

106 search results - page 17 / 22
» On Quadratic Programming with a Ratio Objective
Sort
View
TOG
2012
181views Communications» more  TOG 2012»
11 years 10 months ago
Soft body locomotion
We present a physically-based system to simulate and control the locomotion of soft body characters without skeletons. We use the finite element method to simulate the deformatio...
Jie Tan, Greg Turk, C. Karen Liu
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 2 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
ICASSP
2007
IEEE
13 years 11 months ago
Depth Detection of Light Field
We propose an algorithm to detect depths in a light field. Specifically, given a 4D light field, we find all planes at which objects are located. Although the exact depth of each ...
Yi-Hao Kao, Chia-Kai Liang, Li-Wen Chang, Homer H....
TCS
2010
13 years 2 months ago
Information measures for infinite sequences
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defin...
Luis Filipe Coelho Antunes, Andre Souto
ICALP
2004
Springer
14 years 1 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella