3020 search results - page 427 / 604 » Optimal partition trees |
206
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal...
187
click to vote
PAMI
2006
15 years 6 months ago
2006
This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We pres...
176
click to vote
IPSN
2005
Springer
15 years 12 months ago
2005
Springer
Abstract— Sensing, processing and communication must be jointly optimized for efficient operation of resource-limited wireless sensor networks. We propose a novel source-channel...
185
click to vote
DAC
2005
ACM
15 years 8 months ago
2005
ACM
This paper proposes a fast decoupling capacitance (decap) allocation and budgeting algorithm for both early stage decap estimation and later stage decap minimization in today’s ...
158
click to vote
ITSL
2008
15 years 8 months ago
2008
Clustering can be defined as a data assignment problem where the goal is to partition the data into nonhierarchical groups of items. In our previous work, we suggested an informati...