Sciweavers

3235 search results - page 626 / 647
» Partial Redundant Modeling
Sort
View
COMPGEOM
2003
ACM
14 years 3 months ago
Polygon decomposition based on the straight line skeleton
We propose a novel type of decomposition for polygonal shapes. It is thought that, for the task of object recognition, the human visual system uses a part-based representation. De...
Mirela Tanase, Remco C. Veltkamp
XMLSEC
2003
ACM
14 years 3 months ago
An access control framework for business processes for web services
Business Processes for Web Services are the new paradigm for the lightweight integration of business from different enterprises. Whereas the security and access control policies ...
Hristo Koshutanski, Fabio Massacci
CIAC
2003
Springer
98views Algorithms» more  CIAC 2003»
14 years 3 months ago
Improving Customer Proximity to Railway Stations
Abstract. We consider problems of (new) station placement along (existing) railway tracks, so as to increase the number of users. We prove that, in spite of the NP-hardness for the...
Evangelos Kranakis, Paolo Penna, Konrad Schlude, D...
FCT
2003
Springer
14 years 3 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
COMPGEOM
2010
ACM
14 years 3 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è...