2520 search results - page 377 / 504 » The complexity of approximating entropy |
146
click to vote
SIAMCOMP
2002
15 years 4 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
195
click to vote
JCST
2010
15 years 2 months ago
2010
Surface triangle meshes and volume data are two commonly used representations of digital geometry. Converting from triangle meshes to volume data is challenging, since triangle mes...
137
click to vote
PAMI
2010
15 years 2 months ago
2010
In this paper, we address the tasks of detecting, segmenting, parsing, and matching deformable objects. We use a novel probabilistic object model that we call a hierarchical defor...
144
click to vote
TCOM
2010
15 years 2 months ago
2010
—Receive antenna selection for unitary space-time modulation (USTM) over semi-correlated Ricean fading channels is analyzed (this work generalizes that of Ma and Tepedelenlio˘gl...
153
click to vote
SSDBM
2010
IEEE
15 years 2 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...