Sciweavers

166 search results - page 18 / 34
» Complexity of Some Geometric and Topological Problems
Sort
View
COMPGEOM
2010
ACM
14 years 1 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
ICPR
2004
IEEE
14 years 9 months ago
An Algorithm for Real Time Eye Detection in Face Images
The problem of eye detection in face images is very important for a large number of applications ranging from face recognition to gaze tracking. In this paper we propose a new alg...
Arcangelo Distante, Grazia Cicirelli, Marco Leo, T...
ICN
2005
Springer
14 years 2 months ago
Packet Scheduling Across Networks of Switches
Abstract. Recent developments in computer and communication networks require scheduling decisions to be made under increasingly complex system dynamics. We model and analyze the pr...
Kevin Ross, Nicholas Bambos
CGF
2010
218views more  CGF 2010»
13 years 8 months ago
Mesh Snapping: Robust Interactive Mesh Cutting Using Fast Geodesic Curvature Flow
This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but re...
Juyong Zhang, Chunlin Wu, Jianfei Cai, Jianmin Zhe...
CVPR
2011
IEEE
13 years 10 days ago
Symmetric Piecewise Planar Object Reconstruction from a Single Image
Recovering 3D geometry from a single view of an object is an important and challenging problem in computer vision. Previous methods mainly focus on one specific class of objects ...
Tianfan XUE, Jianzhuang LIU