2392 search results - page 27 / 479 » Matching data dissemination algorithms to application requir... |
87
Voted
CEC
2007
IEEE
15 years 6 months ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
ETFA
2008
IEEE
15 years 6 months ago
2008
IEEE
Current approaches to feature detection and matching in images strive to increase the repeatability of the detector and minimize the degree of outliers in the matching. In this pa...
92
Voted
ICDCSW
2003
IEEE
15 years 5 months ago
2003
IEEE
Broadcasting provides an e cient means for disseminating information in both wired and wireless setting. In this paper, we study di erent client side cache organizations for vario...
167
click to vote
GIS
2009
ACM
16 years 22 days ago
2009
ACM
A common problem in moving object databases (MOD) is the reconstruction of a trajectory from a trajectory sample (i.e., a finite sequence of time-space points). A typical solution...
107
click to vote
SIGMOD
1998
ACM
15 years 3 months ago
1998
ACM
Data mining applications place special requirements on clustering algorithms including: the ability to nd clusters embedded in subspaces of high dimensional data, scalability, end...