2317 search results - page 157 / 464 » classification 2008 |
DCG
2006
15 years 2 months ago
2006
It is proved that a triangulation of a polyhedron can always be transformed into any other triangulation of the polyhedron using only elementary moves. One consequence is that an ...
121
click to vote
SIAMCOMP
2008
15 years 2 months ago
2008
![Resolution Is Not Automatizable Unless W[P] Is Tractable](https://sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Resolution Is Not Automatizable Unless W[P] Is Tractable")
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
137
click to vote
ISCI
2008
15 years 2 months ago
2008
In order to characterize the non-Gaussian information contained within the EEG signals, a new feature extraction method based on bispectrum is proposed and applied to the classifi...
122
Voted
TREC
2003
15 years 3 months ago
2003
This paper reports our efforts on developing a language modeling approach to passage question answering. In particular, we address the following two problems: (i) generalized lang...
103
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: rand...