Sciweavers

2608 search results - page 432 / 522
» Inferring Answers to Queries
Sort
View
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 4 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
15 years 11 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...
EDBT
2009
ACM
184views Database» more  EDBT 2009»
15 years 11 months ago
Distributed similarity search in high dimensions using locality sensitive hashing
In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH...
Parisa Haghani, Sebastian Michel, Karl Aberer
IEEEIAS
2009
IEEE
15 years 11 months ago
Modeling the Co-evololution DNS Worms and Anti-worms in IPv6 Networks
A computer worm is an autonomous malicious, selfreplicating and propagating piece of code that is able to spread fast in computer networks, exploiting the vulnerabilities it disco...
Pantelis Kammas, Thodoros Komninos, Yannis C. Stam...
ICPP
2007
IEEE
15 years 10 months ago
ASAP: An Advertisement-based Search Algorithm for Unstructured Peer-to-peer Systems
— Most of existing search algorithms for unstructured peer-to-peer (P2P) systems share one common approach: the requesting node sends out a query and the query message is repeate...
Peng Gu, Jun Wang, Hailong Cai