Sciweavers

85 search results - page 3 / 17
» On Small Hard Leaf Languages
Sort
View
CJTCS
1999
133views more  CJTCS 1999»
13 years 4 months ago
The Permanent Requires Large Uniform Threshold Circuits
We show that thepermanent cannot be computed by uniform constantdepth threshold circuits of size Tn, for any function T such that for all k, Tk n = o2n. More generally, we show th...
Eric Allender
CLIN
2003
13 years 6 months ago
Natural Language Processing in Information Retrieval
Many Natural Language Processing (NLP) techniques have been used in Information Retrieval. The results are not encouraging. Simple methods (stopwording, porter-style stemming, etc...
Thorsten Brants
TLDI
2005
ACM
151views Formal Methods» more  TLDI 2005»
13 years 10 months ago
Strict bidirectional type checking
Completely annotated lambda terms (such as are arrived at via the straightforward encodings of various types from System F) contain much redundant type information. Consequently, ...
Adam J. Chlipala, Leaf Petersen, Robert Harper
TLDI
2003
ACM
135views Formal Methods» more  TLDI 2003»
13 years 10 months ago
Typed compilation of recursive datatypes
Standard ML employs an opaque (or generative) semantics of datatypes, in which every datatype declaration produces a new type that is different from any other type, including othe...
Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, K...
KDD
2008
ACM
246views Data Mining» more  KDD 2008»
14 years 5 months ago
Direct mining of discriminative and essential frequent patterns via model-based search tree
Frequent patterns provide solutions to datasets that do not have well-structured feature vectors. However, frequent pattern mining is non-trivial since the number of unique patter...
Wei Fan, Kun Zhang, Hong Cheng, Jing Gao, Xifeng Y...