2487 search results - page 400 / 498 » Partitions of Graphs into Trees |
122
Voted
ICIAP
2005
ACM
16 years 3 months ago
2005
ACM
As the accuracy of conventional classifiers, based only on a static partitioning of feature space, appears to be approaching a limit, it may be useful to consider alternative appro...
134
click to vote
ICDE
2010
IEEE
16 years 3 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
141
click to vote
SODA
2010
ACM
16 years 23 days ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
123
click to vote
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Distributed PRocessing in Mobile Environments (DPRiME) is a framework for processing large data sets across an ad-hoc network. Developed to address the shortcomings of Google’s ...
111
click to vote
ICPR
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper proposes a new single-frame image upconversion approach that uses prior information. The proposed method overcomes the drawbacks of the Kondo 2001 where the class membe...