Sciweavers

6974 search results - page 1343 / 1395
» Querying Semi-Structured Data
Sort
View
WWW
2009
ACM
14 years 8 months ago
Click chain model in web search
Given a terabyte click log, can we build an efficient and effective click model? It is commonly believed that web search click logs are a gold mine for search business, because th...
Anitha Kannan, Chao Liu 0001, Christos Faloutsos, ...
WWW
2008
ACM
14 years 8 months ago
Contextual advertising by combining relevance with click feedback
Contextual advertising supports much of the Web's ecosystem today. User experience and revenue (shared by the site publisher ad the ad network) depend on the relevance of the...
Deepayan Chakrabarti, Deepak Agarwal, Vanja Josifo...
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
14 years 8 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
ICALP
2009
Springer
14 years 8 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro
VLDB
2003
ACM
147views Database» more  VLDB 2003»
14 years 8 months ago
RE-tree: an efficient index structure for regular expressions
Due to their expressive power, Regular Expressions (REs) are quickly becoming an integral part of language specifications for several important application scenarios. Many of thes...
Chee Yong Chan, Minos N. Garofalakis, Rajeev Rasto...
« Prev « First page 1343 / 1395 Last » Next »