Sciweavers

1322 search results - page 123 / 265
» Parameterized counting problems
Sort
View
IJCNLP
2004
Springer
14 years 3 months ago
Using a Smoothing Maximum Entropy Model for Chinese Nominal Entity Tagging
This paper treats nominal entity tagging as a six-way (five categories plus nonentity) classification problem and applies a smoothing maximum entropy (ME) model with a Gaussian pr...
Jinying Chen, Nianwen Xue, Martha Stone Palmer
NSDI
2010
13 years 11 months ago
Carousel: Scalable Logging for Intrusion Prevention Systems
We address the problem of collecting unique items in a large stream of information in the context of Intrusion Prevention Systems (IPSs). IPSs detect attacks at gigabit speeds and...
Vinh The Lam, Michael Mitzenmacher, George Varghes...
BMVC
2010
13 years 8 months ago
Pairwise Macropixel Comparison Can Work at Least as Well as Advanced Holistic Algorithms for Face Recognition
It is well known that, due to illumination effects and the registration/alignment problem, it does not make sense to compare the "values" of two single-pixels for face r...
Liang Chen
NAACL
2010
13 years 8 months ago
Language identification of names with SVMs
The task of identifying the language of text or utterances has a number of applications in natural language processing. Language identification has traditionally been approached w...
Aditya Bhargava, Grzegorz Kondrak
CORR
2011
Springer
156views Education» more  CORR 2011»
13 years 5 months ago
Impossibility of Succinct Quantum Proofs for Collision-Freeness
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
Scott Aaronson