455 search results - page 79 / 91 » On Trees and Noncrossing Partitions |
CIKM
1994
Springer
15 years 1 months ago
1994
Springer
In a spatial database, an object may extend arbitrarily in space. As a result, many spatial data structures e.g., the quadtree, the cell tree, the R+-tree represent an object by p...
GLOBECOM
2009
IEEE
15 years 1 months ago
2009
IEEE
Abstract--In this paper, we propose a near-maximum likelihood (ML) detection method referred to as reduced dimension ML search (RD-MLS). The RD-MLS detector is based on a partition...
70
Voted
CSB
2004
IEEE
15 years 1 months ago
2004
IEEE
Our previous work to accelerate phylogeny inference using HW/SW(Hardware/Software) co-design has recently been extended to a more powerful embedded computing platform. In this pla...
VLDB
1995
ACM
15 years 1 months ago
1995
ACM
Classification, which involves finding rules that partition a given da.ta set into disjoint groups, is one class of data mining problems. Approaches proposed so far for mining cla...
BMVC
2001
14 years 12 months ago
2001
We introduce Scene Structural Matrix (SSM), a novel image content descriptor and its application to invariant image retrieval. The SSM captures the overall structural characterist...