1731 search results - page 58 / 347 » Maximum likelihood analysis of algorithms and data structure... |
119
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
: In this paper I present several novel, efficient, algorithmic techniques for solving some multidimensional geometric data management and analysis problems. The techniques are bas...
162
click to vote
BMCBI
2010
14 years 10 months ago
2010
Background: In a high throughput setting, effective flow cytometry data analysis depends heavily on proper data preprocessing. While usual preprocessing steps of quality assessmen...
132
click to vote
CAV
2004
Springer
15 years 9 months ago
2004
Springer
—We introduce a new BDD-like data structure called Hybrid-Restriction Diagrams (HRDs) for the representation and manipulation of linear hybrid automata (LHA) state-spaces and pre...
145
click to vote
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
118
click to vote
SDM
2009
SIAM
16 years 1 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...