Sciweavers

5592 search results - page 85 / 1119
» On Random Betweenness Constraints
Sort
View
CP
2005
Springer
14 years 3 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich
SIGGRAPH
1998
ACM
14 years 2 months ago
An Anthropometric Face Model Using Variational Techniques
We describe a system that automatically generates varied geometric models of human faces. A collection of random measurements of the face is generated according to anthropometric ...
Douglas DeCarlo, Dimitris N. Metaxas, Matthew Ston...
MM
2006
ACM
221views Multimedia» more  MM 2006»
14 years 4 months ago
Video object segmentation by motion-based sequential feature clustering
Segmentation of video foreground objects from background has many important applications, such as human computer interaction, video compression, multimedia content editing and man...
Mei Han, Wei Xu, Yihong Gong
ISAAC
2003
Springer
85views Algorithms» more  ISAAC 2003»
14 years 3 months ago
Geometric Restrictions on Producible Polygonal Protein Chains
Fixed-angle polygonal chains in 3D serve as an interesting model of protein backbones. Here we consider such chains produced inside a “machine” modeled crudely as a cone, and e...
Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
12 years 14 days ago
Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
Aditya Bhaskara, Moses Charikar, Aravindan Vijayar...