Sciweavers

1888 search results - page 275 / 378
» Algorithms for Querying by Spatial Structure
Sort
View
STOC
2009
ACM
99views Algorithms» more  STOC 2009»
14 years 9 months ago
Testing juntas nearly optimally
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
Eric Blais
DASFAA
2006
IEEE
152views Database» more  DASFAA 2006»
14 years 3 months ago
Effective Keyword Search in XML Documents Based on MIU
Keyword search is an effective approach for most users to search for information because they do not need to learn complex query languages or the underlying structures of the data....
Jianjun Xu, Jiaheng Lu, Wei Wang 0009, Baile Shi
SIGMOD
1999
ACM
112views Database» more  SIGMOD 1999»
14 years 1 months ago
A New Method for Similarity Indexing of Market Basket Data
In recent years, many data mining methods have been proposed for finding useful and structured information from market basket data. The association rule model was recently propos...
Charu C. Aggarwal, Joel L. Wolf, Philip S. Yu
PODS
2006
ACM
217views Database» more  PODS 2006»
14 years 9 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
ICTAI
2008
IEEE
14 years 3 months ago
A Lattice-Based Model for Recommender Systems
A major challenge in building recommender systems is organizing the recommendation space since, the underlying data organization scheme has a significant impact on the overall pe...
Shriram Narayanaswamy, Raj Bhatnagar