Sciweavers

574 search results - page 13 / 115
» A General Framework for Covering Concepts using Terminologie...
Sort
View
MP
1998
109views more  MP 1998»
14 years 9 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
CN
2006
95views more  CN 2006»
14 years 10 months ago
Generalized Nash Bargaining Solution for bandwidth allocation
For over a decade, the Nash Bargaining Solution (NBS) concept from cooperative game theory has been used in networks to share resources fairly. Due to its many appealing propertie...
Corinne Touati, Eitan Altman, Jérôme ...
104
Voted
CORR
2010
Springer
178views Education» more  CORR 2010»
14 years 8 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
LREC
2008
100views Education» more  LREC 2008»
14 years 11 months ago
Ensuring Semantic Interoperability on Lexical Resources
In this paper, we describe a unifying approach to tackle data heterogeneity issues for lexica and related resources. We present LEXUS, our software that implements the Lexical Mar...
Marc Kemps-Snijders, Claus Zinn, Jacquelijn Ringer...
97
Voted
ML
2002
ACM
123views Machine Learning» more  ML 2002»
14 years 9 months ago
Feature Generation Using General Constructor Functions
Most classification algorithms receive as input a set of attributes of the classified objects. In many cases, however, the supplied set of attributes is not sufficient for creatin...
Shaul Markovitch, Dan Rosenstein