3875 search results - page 515 / 775 » Approximation algorithms for the 0-extension problem |
172
click to vote
STOC
2007
ACM
16 years 7 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
214
click to vote
CONSTRAINTS
1998
15 years 6 months ago
1998
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
159
click to vote
TON
1998
15 years 6 months ago
1998
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...
173
click to vote
OL
2007
15 years 6 months ago
2007
In this paper we construct the linear support vector machine (SVM) based on the nonlinear rescaling (NR) methodology (see [9, 11, 10] and references therein). The formulation of t...
195
click to vote
JAIR
2010
15 years 5 months ago
2010
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...