2080 search results - page 179 / 416 » Measuring empirical computational complexity |
151
click to vote
ALGORITHMICA
2008
15 years 5 months ago
2008
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
166
Voted
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
Given a unlabelled set of points X ∈ RN belonging to k groups, we propose a method to identify cluster assignments that provides maximum separating margin among the clusters. We...
154
click to vote
DSN
2009
IEEE
15 years 11 months ago
2009
IEEE
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...
149
click to vote
EMMCVPR
1997
Springer
15 years 9 months ago
1997
Springer
Abstract. In this paper a rigorous mathematical framework of deterministic annealing and mean-field approximation is presented for a general class of partitioning, clustering and ...
149
click to vote
ICALP
2009
Springer
16 years 5 months ago
2009
Springer
We initiate the study of sublinear-time algorithms in the external memory model [14]. In this model, the data is stored in blocks of a certain size B, and the algorithm is charged...