Sciweavers

2392 search results - page 21 / 479
» Matching data dissemination algorithms to application requir...
Sort
View
SPIRE
2007
Springer
15 years 5 months ago
Approximate String Matching with Lempel-Ziv Compressed Indexes
Abstract. A compressed full-text self-index for a text T is a data structure requiring reduced space and able of searching for patterns P in T. Furthermore, the structure can repro...
Luís M. S. Russo, Gonzalo Navarro, Arlindo ...
COMSWARE
2007
IEEE
15 years 6 months ago
Scalable Multicast Platforms for a New Generation of Robust Distributed Applications
1 As distributed systems scale up and are deployed into increasingly sensitive settings, demand is rising for a new generation of communications middleware in support of applicati...
Ken Birman, Mahesh Balakrishnan, Danny Dolev, Tudo...
HCW
1998
IEEE
15 years 3 months ago
A Dynamic Matching and Scheduling Algorithm for Heterogeneous Computing Systems
A heterogeneous computing system provides a variety of different machines, orchestrated to perform an application whose subtasks have diverse execution requirements. The subtasks ...
Muthucumaru Maheswaran, Howard Jay Siegel
SIGMOD
2009
ACM
192views Database» more  SIGMOD 2009»
15 years 12 months ago
A gauss function based approach for unbalanced ontology matching
Ontology matching, aiming to obtain semantic correspondences between two ontologies, has played a key role in data exchange, data integration and metadata management. Among numero...
Qian Zhong, Hanyu Li, Juanzi Li, Guo Tong Xie, Jie...
AAAI
2010
15 years 1 months ago
Fast Algorithms for Top-k Approximate String Matching
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
Zhenglu Yang, Jianjun Yu, Masaru Kitsuregawa