Sciweavers

27119 search results - page 5084 / 5424
» Languages
Sort
View
JMLR
2010
161views more  JMLR 2010»
15 years 1 months ago
Training and Testing Low-degree Polynomial Data Mappings via Linear SVM
Kernel techniques have long been used in SVM to handle linearly inseparable problems by transforming data to a high dimensional space, but training and testing large data sets is ...
Yin-Wen Chang, Cho-Jui Hsieh, Kai-Wei Chang, Micha...
JMLR
2010
88views more  JMLR 2010»
15 years 1 months ago
Unsupervised Aggregation for Classification Problems with Large Numbers of Categories
Classification problems with a very large or unbounded set of output categories are common in many areas such as natural language and image processing. In order to improve accurac...
Ivan Titov, Alexandre Klementiev, Kevin Small, Dan...
LOGCOM
2010
120views more  LOGCOM 2010»
15 years 1 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
LOGCOM
2010
128views more  LOGCOM 2010»
15 years 1 months ago
Comparing LTL Semantics for Runtime Verification
When monitoring a system wrt. a property defined in a temporal logic such as LTL, a major concern is to settle with an adequate interpretation of observable system events; that is,...
Andreas Bauer 0002, Martin Leucker, Christian Scha...
LRE
2010
145views more  LRE 2010»
15 years 1 months ago
Annotation of multiword expressions in the Prague dependency treebank
In this article we want to demonstrate that annotation of multiword expressions in the Prague Dependency Treebank is a well defined task, that it is useful as well as feasible, an...
Eduard Bejcek, Pavel Stranák
« Prev « First page 5084 / 5424 Last » Next »