Sciweavers

1601 search results - page 146 / 321
» Closed Sets for Labeled Data
Sort
View
DAWAK
2006
Springer
15 years 10 months ago
On the Computation of Maximal-Correlated Cuboids Cells
The main idea of iceberg data cubing methods relies on optimization techniques for computing only the cuboids cells above certain minimum support threshold. Even using such approac...
Ronnie Alves, Orlando Belo
STOC
2009
ACM
120views Algorithms» more  STOC 2009»
16 years 7 months ago
Bit-probe lower bounds for succinct data structures
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
Emanuele Viola
ACL
2011
14 years 10 months ago
Effective Measures of Domain Similarity for Parsing
It is well known that parsing accuracy suffers when a model is applied to out-of-domain data. It is also known that the most beneficial data to parse a given domain is data that ...
Barbara Plank, Gertjan van Noord
WWW
2006
ACM
16 years 7 months ago
Large-scale text categorization by batch mode active learning
Large-scale text categorization is an important research topic for Web data mining. One of the challenges in large-scale text categorization is how to reduce the amount of human e...
Steven C. H. Hoi, Rong Jin, Michael R. Lyu
ICFP
2005
ACM
16 years 6 months ago
PolyAML: a polymorphic aspect-oriented functional programming language
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
Daniel S. Dantas, David Walker, Geoffrey Washburn,...