Sciweavers

836 search results - page 45 / 168
» On the Complexity of Train Assignment Problems
Sort
View
MCS
2010
Springer
15 years 2 months ago
A Support Kernel Machine for Supervised Selective Combining of Diverse Pattern-Recognition Modalities
Abstract. The Support Kernel Machine (SKM) and the Relevance Kernel Machine (RKM) are two principles for selectively combining objectrepresentation modalities of different kinds b...
Alexander Tatarchuk, Eugene Urlov, Vadim Mottl, Da...
COLING
2010
14 years 10 months ago
Automatic Treebank Conversion via Informed Decoding
In this paper, we focus on the challenge of automatically converting a constituency treebank (source treebank) to fit the standard of another constituency treebank (target treeban...
Muhua Zhu, Jingbo Zhu
SOFSEM
2007
Springer
15 years 10 months ago
Algorithmic Aspects of Minimum Energy Edge-Disjoint Paths in Wireless Networks
The problem of finding k minimum energy, edge-disjoint paths in wireless networks (MEEP) arises in the context of routing and belongs to the class of range assignment problems. A ...
Markus Maier, Steffen Mecke, Dorothea Wagner
ESORICS
1998
Springer
15 years 8 months ago
Rules for Designing Multilevel Object-Oriented Databases
When implementing a multilevel security policy for Object-Oriented Databases (OODBs), several aspects have to be investigated. One of these aspect is the design of multilevel OODB...
Frédéric Cuppens, Alban Gabillon
COLT
2010
Springer
15 years 1 months ago
Quantum Predictive Learning and Communication Complexity with Single Input
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to a...
Dmitry Gavinsky