Sciweavers

882 search results - page 118 / 177
» On the Hardness of Graph Isomorphism
Sort
View
JCB
2007
168views more  JCB 2007»
13 years 8 months ago
Fast Molecular Shape Matching Using Contact Maps
In this paper, we study the problem of computing the similarity of two protein structures ring their contact-map overlap. Contact-map overlap abstracts the problem of computing th...
Pankaj K. Agarwal, Nabil H. Mustafa, Yusu Wang
SIAMCOMP
2000
104views more  SIAMCOMP 2000»
13 years 8 months ago
On the Difficulty of Designing Good Classifiers
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...
Michelangelo Grigni, Vincent Mirelli, Christos H. ...
CVPR
2006
IEEE
14 years 10 months ago
Composite Templates for Cloth Modeling and Sketching
Cloth modeling and recognition is an important and challenging problem in both vision and graphics tasks, such as dressed human recognition and tracking, human sketch and portrait...
Hong Chen, Zijian Xu, Ziqiang Liu, Song Chun Zhu
CCS
2009
ACM
14 years 9 months 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
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
14 years 9 months ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...