690 search results - page 24 / 138 » Dense Admissible Sets |
135
click to vote
PAMI
2012
13 years 2 months ago
2012
—We propose a probabilistic formulation of joint silhouette extraction and 3D reconstruction given a series of calibrated 2D images. Instead of segmenting each image separately i...
KDD
2006
ACM
16 years 5 days ago
2006
ACM
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
123
click to vote
TKDE
2012
13 years 2 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...
EUROPAR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. This paper presents a study of performance optimization of dense matrix multiplication on IBM Cyclops-64(C64) chip architecture. Although much has been published on how t...
STOC
1995
ACM
15 years 3 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...