Sciweavers

8695 search results - page 240 / 1739
» Making the Complex Simple
Sort
View
COMPGEOM
2003
ACM
15 years 12 months ago
Molecular shape analysis based upon the morse-smale complex and the connolly function
Docking is the process by which two or several molecules form a complex. Docking involves the geometry of the molecular surfaces, as well as chemical and energetical consideration...
Frédéric Cazals, Frédé...
MM
2003
ACM
239views Multimedia» more  MM 2003»
15 years 12 months ago
Foreground object detection from videos containing complex background
This paper proposes a novel method for detection and segmentation of foreground objects from a video which contains both stationary and moving background objects and undergoes bot...
Liyuan Li, Weimin Huang, Irene Y. H. Gu, Qi Tian
FUN
2010
Springer
233views Algorithms» more  FUN 2010»
15 years 11 months ago
The Complexity of Flood Filling Games
We study the complexity of the popular one player combinatorial game known as Flood-It. In this game the player is given an n×n board of tiles where each tile is allocated one of ...
David Arthur, Raphaël Clifford, Markus Jalsen...
SODA
2008
ACM
118views Algorithms» more  SODA 2008»
15 years 8 months ago
Geodesic Delaunay triangulation and witness complex in the plane
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
Jie Gao, Leonidas J. Guibas, Steve Oudot, Yue Wang
AI
2010
Springer
15 years 6 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim