3020 search results - page 375 / 604 » Optimal partition trees |
172
click to vote
ICIAP
2005
ACM
16 years 6 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...
180
click to vote
ICDE
2010
IEEE
16 years 6 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 ...
172
click to vote
KDD
2009
ACM
16 years 1 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 ...
161
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
185
click to vote
WETICE
2007
IEEE
16 years 25 days ago
2007
IEEE
Designing a collaborative architecture for real-time applications is an intricate challenge that usually involves dealing with the real-time constraints, resource limitations and ...