Sciweavers

2145 search results - page 378 / 429
» Pattern-Based Query Answering
Sort
View
SIGCOMM
2010
ACM
13 years 8 months ago
Trust no one: a decentralized matching service for privacy in location based services
We propose a new approach to ensure privacy in location based services, without requiring any support from a"trusted" entity. We observe that users of location based ser...
Sharad Jaiswal, Animesh Nandi
BMCBI
2006
172views more  BMCBI 2006»
13 years 8 months ago
BioWarehouse: a bioinformatics database warehouse toolkit
Background: This article addresses the problem of interoperation of heterogeneous bioinformatics databases. Results: We introduce BioWarehouse, an open source toolkit for construc...
Thomas J. Lee, Yannick Pouliot, Valerie Wagner, Pr...
VLDB
2002
ACM
154views Database» more  VLDB 2002»
13 years 7 months ago
I/O-Conscious Data Preparation for Large-Scale Web Search Engines
Given that commercial search engines cover billions of web pages, efficiently managing the corresponding volumes of disk-resident data needed to answer user queries quickly is a f...
Maxim Lifantsev, Tzi-cker Chiueh
CIKM
2010
Springer
13 years 6 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 6 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...