Sciweavers

2487 search results - page 400 / 498
» Partitions of Graphs into Trees
Sort
View
ICIAP
2005
ACM
14 years 8 months ago
Interactive, Mobile, Distributed Pattern Recognition
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...
George Nagy
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
14 years 8 months ago
Approximate String Search in Spatial Databases
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 ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 5 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
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 ...
Timothy M. Chan, Mihai Patrascu
KDD
2009
ACM
146views Data Mining» more  KDD 2009»
14 years 3 months ago
Mining in a mobile environment
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 ...
Sean McRoskey, James Notwell, Nitesh V. Chawla, Ch...
ICPR
2008
IEEE
14 years 2 months ago
Finding the splitting vector for image resolution up-conversion
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...
Xinyu Xu, Hao Pan