Sciweavers

12015 search results - page 347 / 2403
» Interactive Algorithms 2005
Sort
View
SAT
2005
Springer
122views Hardware» more  SAT 2005»
15 years 9 months ago
A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas
We tackle the problem of finding a smallest-cardinality MUS (SMUS) of a given formula. The SMUS provides a succinct explanation of infeasibility and is valuable for applications th...
Maher N. Mneimneh, Inês Lynce, Zaher S. Andr...
102
Voted
WG
2005
Springer
15 years 9 months ago
Approximation Algorithms for the Bi-criteria Weighted max-cut Problem
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
Eric Angel, Evripidis Bampis, Laurent Gourvè...
WIRN
2005
Springer
15 years 9 months ago
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
Alberto Bertoni, Giorgio Valentini
WSTST
2005
Springer
15 years 9 months ago
An Incremental Algorithm to find Asymmetric Word Similarities for Fuzzy Text Mining
Synonymy – different words with the same meaning – is a major problem for text mining systems. We have proposed asymmetric word similarities as a possible solution to this prob...
Trevor P. Martin, Masrah Azmi-Murad
IPL
2006
79views more  IPL 2006»
15 years 3 months ago
Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy
This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation ter...
Jeng Farn Lee, Meng Chang Chen, Ming-Tat Ko, Wanji...