Sciweavers

144 search results - page 25 / 29
» Signature Schemes Based on Two Hard Problems Simultaneously
Sort
View
KDD
2007
ACM
179views Data Mining» more  KDD 2007»
14 years 1 months ago
Mining statistically important equivalence classes and delta-discriminative emerging patterns
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...
Jinyan Li, Guimei Liu, Limsoon Wong
KAIS
2006
247views more  KAIS 2006»
13 years 7 months ago
XCQ: A queriable XML compression system
XML has already become the de facto standard for specifying and exchanging data on the Web. However, XML is by nature verbose and thus XML documents are usually large in size, a fa...
Wilfred Ng, Wai Yeung Lam, Peter T. Wood, Mark Lev...
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
CORR
2002
Springer
90views Education» more  CORR 2002»
13 years 7 months ago
Mostly-Unsupervised Statistical Segmentation of Japanese Kanji Sequences
Given the lack of word delimiters in written Japanese, word segmentation is generally considered a crucial first step in processing Japanese texts. Typical Japanese segmentation a...
Rie Kubota Ando, Lillian Lee
SSDBM
2010
IEEE
142views Database» more  SSDBM 2010»
13 years 5 months ago
Efficient and Adaptive Distributed Skyline Computation
Skyline queries have attracted considerable attention over the last few years, mainly due to their ability to return interesting objects without the need for user-defined scoring f...
George Valkanas, Apostolos N. Papadopoulos