Sciweavers

2100 search results - page 45 / 420
» Fundamentals of the problem
Sort
View
CORR
2008
Springer
92views Education» more  CORR 2008»
13 years 10 months ago
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Consider a set of labels L and a set of trees T = {T (1) , T (2) , . . . , T (k) } where each tree T (i) is distinctly leaf-labeled by some subset of L. One fundamental problem is ...
Viet Tung Hoang, Wing-Kin Sung
4OR
2010
107views more  4OR 2010»
13 years 9 months ago
On matrices with the Edmonds-Johnson property
s (from Seminario Dottorato's web page) 3 Notes of the seminars 9 Nicola Mazzari, A note on Grothendieck fundamental group . . . . . . . . . . . . . . 9 Marco Formentin, Infor...
Alberto Del Pia
CORR
2011
Springer
188views Education» more  CORR 2011»
13 years 5 months ago
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Mark Sh. Levin
USS
2008
14 years 13 days ago
Research Challenges for the Security of Control Systems
In this paper we attempt to answer two questions: (1) Why should we be interested in the security of control systems? And (2) What are the new and fundamentally different requirem...
Alvaro A. Cárdenas, Saurabh Amin, Shankar S...
COLING
2008
13 years 11 months ago
An Improved Hierarchical Bayesian Model of Language for Document Classification
This paper addresses the fundamental problem of document classification, and we focus attention on classification problems where the classes are mutually exclusive. In the course ...
Ben Allison