Sciweavers

1756 search results - page 94 / 352
» Mining Query Logs
Sort
View
132
Voted
JCIT
2010
174views more  JCIT 2010»
14 years 9 months ago
Efficient Ming of Top-K Closed Sequences
Sequence mining is an important data mining task. In order to retrieve interesting sequences from a large database, a minimum support threshold is needed to be specified. Unfortun...
Panida Songram
KDD
2008
ACM
115views Data Mining» more  KDD 2008»
16 years 2 months ago
Topical query decomposition
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
Francesco Bonchi, Carlos Castillo, Debora Donato, ...
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
15 years 6 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
117
Voted
STOC
2007
ACM
179views Algorithms» more  STOC 2007»
16 years 2 months ago
Towards 3-query locally decodable codes of subexponential length
A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit xi of the message by querying only...
Sergey Yekhanin
TOC
2010
123views Management» more  TOC 2010»
14 years 9 months ago
Rounds vs. Queries Tradeoff in Noisy Computation
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...
Navin Goyal, Michael Saks