Sciweavers

683 search results - page 120 / 137
» A search engine for finding highly relevant applications
Sort
View
CORR
2010
Springer
98views Education» more  CORR 2010»
13 years 7 months ago
Maximal Intersection Queries in Randomized Input Models
Consider a family of sets and a single set, called the query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Time constra...
Benjamin Hoffmann, Mikhail Lifshits, Yury Lifshits...
ISCI
2008
116views more  ISCI 2008»
13 years 7 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
KAIS
2006
164views more  KAIS 2006»
13 years 7 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
DOCENG
2010
ACM
13 years 7 months ago
Next generation typeface representations: revisiting parametric fonts
Outline font technology has long been established as the standard way to represent typefaces, allowing characters to be represented independently of print size and resolution. Alt...
Tamir Hassan, Changyuan Hu, Roger D. Hersch
CGO
2007
IEEE
14 years 1 months ago
Ubiquitous Memory Introspection
Modern memory systems play a critical role in the performance of applications, but a detailed understanding of the application behavior in the memory system is not trivial to atta...
Qin Zhao, Rodric M. Rabbah, Saman P. Amarasinghe, ...