Sciweavers

135 search results - page 23 / 27
» Hardness of cut problems in directed graphs
Sort
View
107
Voted
CCS
2009
ACM
16 years 10 days ago
The union-split algorithm and cluster-based anonymization of social networks
Knowledge discovery on social network data can uncover latent social trends and produce valuable findings that benefit the welfare of the general public. A growing amount of resea...
Brian Thompson, Danfeng Yao
77
Voted
LICS
2009
IEEE
15 years 6 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
CONSTRAINTS
2006
115views more  CONSTRAINTS 2006»
14 years 11 months ago
A Cost-Regular Based Hybrid Column Generation Approach
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
ICCV
2009
IEEE
14 years 9 months ago
Estimating human shape and pose from a single image
We describe a solution to the challenging problem of estimating human body shape from a single photograph or painting. Our approach computes shape and pose parameters of a 3D huma...
Peng Guan, Alexander Weiss, Alexandru O. Balan, Mi...
91
Voted
VISUALIZATION
2005
IEEE
15 years 5 months ago
Topology-driven Surface Mappings with Robust Feature Alignment
Topological concepts and techniques have been broadly applied in computer graphics and geometric modeling. However, the homotopy type of a mapping between two surfaces has not bee...
Christopher Carner, Miao Jin, Xianfeng Gu, Hong Qi...