Sciweavers

252 search results - page 31 / 51
» Decremental Clique Problem
Sort
View
JDCTA
2010
130views more  JDCTA 2010»
14 years 4 months ago
A Search Algorithm for Clusters in a Network or Graph
A novel breadth-first based structural clustering method for graphs is proposed. Clustering is an important task for analyzing complex networks such as biological networks, World ...
Dongming Chen, Jing Wang, Xiaodong Chen, Xiaowei X...
ICCV
2011
IEEE
13 years 9 months ago
Generalized Subgraph Preconditioners for Large-Scale Bundle Adjustment
We present a generalized subgraph preconditioning (GSP) technique to solve large-scale bundle adjustment problems efficiently. In contrast with previous work which uses either di...
Yong-Dian Jian, Doru C. Balcan, Frank Dellaert
ANOR
2004
170views more  ANOR 2004»
14 years 9 months ago
Graph Coloring for Air Traffic Flow Management
The aim of Air Traffic Flow Management (ATFM) is to enhance the capacity of the airspace while satisfying Air Traffic Control constraints and airlines requests to optimize their o...
Nicolas Barnier, Pascal Brisset
CPM
2004
Springer
168views Combinatorics» more  CPM 2004»
15 years 3 months ago
The Protein Sequence Design Problem in Canonical Model on 2D and 3D Lattices
In this paper we investigate the protein sequence design (PSD) problem (also known as the inverse protein folding problem) under the Canonical model 4 on 2D and 3D lattices [12, 25...
Piotr Berman, Bhaskar DasGupta, Dhruv Mubayi, Robe...
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
15 years 10 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...