4865 search results - page 229 / 973 » The Complexity of Graph Connectivity |
137
click to vote
SIAMCOMP
2000
15 years 4 months ago
2000
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...
170
Voted
MST
2002
15 years 4 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
146
Voted
PRL
2007
15 years 4 months ago
2007
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized ...
216
click to vote
CPAIOR
2010
Springer
15 years 3 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
107
click to vote
GIS
2010
ACM
15 years 3 months ago
2010
ACM
We consider the problem of automatically cleaning massive sonar data point clouds, that is, the problem of automatically removing noisy points that for example appear as a result ...