Sciweavers

2269 search results - page 370 / 454
» Query Incentive Networks
Sort
View
144
Voted
ALGORITHMICA
1998
94views more  ALGORITHMICA 1998»
15 years 2 months ago
A Fully Dynamic Approximation Scheme for Shortest Paths in Planar Graphs
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
Philip N. Klein, Sairam Subramanian
TPDS
1998
112views more  TPDS 1998»
15 years 2 months ago
Parallel Computation in Biological Sequence Analysis
—A massive volume of biological sequence data is available in over 36 different databases worldwide, including the sequence data generated by the Human Genome project. These data...
Tieng K. Yap, Ophir Frieder, Robert L. Martino
EKAW
2010
Springer
15 years 1 months ago
How Much Semantic Data on Small Devices?
Abstract. Semantic tools such as triple stores, reasoners and query engines tend to be designed for large-scale applications. However, with the rise of sensor networks, smart-phone...
Mathieu d'Aquin, Andriy Nikolov, Enrico Motta
OTM
2010
Springer
15 years 10 days ago
Supporting Complex Changes in Evolving Interrelated Web Databanks
In this paper we deal with problems occurring in evolving interrelated Web databanks. Examples of such databanks are networks of interlinked scientific repositories on the Web, man...
Yannis Stavrakas, George Papastefanatos
PVLDB
2010
252views more  PVLDB 2010»
14 years 9 months ago
Efficient and Effective Similarity Search over Probabilistic Data based on Earth Mover's Distance
Probabilistic data is coming as a new deluge along with the technical advances on geographical tracking, multimedia processing, sensor network and RFID. While similarity search is...
Jia Xu, Zhenjie Zhang, Anthony K. H. Tung, Ge Yu