Sciweavers

251 search results - page 16 / 51
» When Size Does Matter
Sort
View
FOCS
2007
IEEE
14 years 1 months ago
Parameterized Proof Complexity
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
ECCC
2007
90views more  ECCC 2007»
13 years 7 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
EMNLP
2008
13 years 8 months ago
A comparison of Bayesian estimators for unsupervised Hidden Markov Model POS taggers
There is growing interest in applying Bayesian techniques to NLP problems. There are a number of different estimators for Bayesian models, and it is useful to know what kinds of t...
Jianfeng Gao, Mark Johnson
DISCEX
2003
IEEE
14 years 21 days ago
Detecting Novel Scans Through Pattern Anomaly Detection
We introduce a technique for detecting anomalous patterns in a categorical feature (one that takes values from a finite alphabet). It differs from most anomaly detection methods u...
Alfonso Valdes
WCNC
2010
IEEE
13 years 11 months ago
DCP-EW: Distributed Congestion-Control Protocol for Encrypted Wireless Networks
Abstract— VCP suffers from a relatively low speed of convergence and exhibits biased fairness in moderate bandwidth high delay networks due to utilizing an insufficient amount o...
Xiaolong Li, Homayoun Yousefi'zadeh