1731 search results - page 91 / 347 » Maximum likelihood analysis of algorithms and data structure... |
188
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
176
click to vote
RAS
2010
15 years 2 months ago
2010
— The problem of representing environments of a mobile robot has been studied intensively in the past. The predominant approaches for geometric representations are gridbased or l...
152
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
132
click to vote
EVOW
2005
Springer
15 years 9 months ago
2005
Springer
In this work, we address the biclustering of gene expression data with evolutionary computation, which has been proven to have excellent performance on complex problems. In express...
119
click to vote
SSPR
2004
Springer
15 years 9 months ago
2004
Springer
Kernel Methods are a class of algorithms for pattern analysis with a number of convenient features. They can deal in a uniform way with a multitude of data types and can be used to...