2392 search results - page 15 / 479 » Matching data dissemination algorithms to application requir... |
PVLDB
2010
14 years 10 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
117
click to vote
INFOSCALE
2006
ACM
15 years 5 months ago
2006
ACM
Cooperative caching is a very important technique for efficient data dissemination and sharing in mobile ad hoc networks (MANETs). Many applications have requirements on the consi...
87
Voted
VLDB
2002
ACM
14 years 11 months ago
2002
ACM
Schema matching is the task of finding semantic correspondences between elements of two schemas. It is needed in many database applications, such as integration of web data source...
109
click to vote
KDD
2000
ACM
15 years 3 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
195
Voted
ICDE
2002
IEEE
16 years 29 days ago
2002
IEEE
Network, web, and disk I/O traffic are usually bursty, self-similar [9, 3, 5, 6] and therefore can not be modeled adequately with Poisson arrivals[9]. However, we do want to model...