1566 search results - page 27 / 314 » On a Cone Covering Problem |
199
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
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...
132
click to vote
APPML
2004
15 years 5 months ago
2004
Abstract. We establish the existence of positive solutions to twin time-scale problems given by the dynamic equation -u (t) = a(t)f(u(t)), t (t1, tn) T with boundary conditions u...
174
click to vote
AICCSA
2007
IEEE
16 years 8 days ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
136
click to vote
WALCOM
2010
IEEE
16 years 28 days ago
2010
IEEE
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
198
click to vote
WEA
2010
Springer
15 years 11 months ago
2010
Springer
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...