Sciweavers

932 search results - page 95 / 187
» Where in the Wikipedia Is That Answer
Sort
View
TIT
2010
146views Education» more  TIT 2010»
13 years 3 months ago
Cooperation with an untrusted relay: a secrecy perspective
We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. For this scenario...
Xiang He, Aylin Yener
KDD
2006
ACM
121views Data Mining» more  KDD 2006»
14 years 9 months ago
Query-time entity resolution
The goal of entity resolution is to reconcile database references corresponding to the same real-world entities. Given the abundance of publicly available databases where entities...
Indrajit Bhattacharya, Lise Getoor, Louis Licamele
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
14 years 9 months ago
Efficient Keyword Search for Smallest LCAs in XML Databases
Keyword search is a proven, user-friendly way to query HTML documents in the World Wide Web. We propose keyword search in XML documents, modeled as labeled trees, and describe cor...
Yu Xu, Yannis Papakonstantinou
SIGMOD
2002
ACM
119views Database» more  SIGMOD 2002»
14 years 9 months ago
Rate-based query optimization for streaming information sources
Relational query optimizers have traditionally relied upon table cardinalities when estimating the cost of the query plans they consider. While this approach has been and continue...
Stratis Viglas, Jeffrey F. Naughton
PERCOM
2006
ACM
14 years 8 months ago
A Dynamic Graph Algorithm for the Highly Dynamic Network Problem
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
Edwin Soedarmadji, Robert J. McEliece