4047 search results - page 220 / 810 » The Discrete Basis Problem |
99
Voted
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
We introduce the notion of a stable instance for a discrete optimization problem, and argue that in many practical situations only sufficiently stable instances are of interest. T...
113
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
For many geometric problems, there are efficient algorithms that use surprisingly very little extra space other than the given array holding the input. For many geometric query pr...
118
Voted
DATE
2005
IEEE
15 years 9 months ago
2005
IEEE
A class of discrete event synthesis problems can be reduced to solving language equations F • X ⊆ S, where F is the fixed component and S the specification. Sequential synthes...
113
Voted
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Various algorithms have been developed and applied to structural optimization, in which cross-sectional areas of structure members are assumed to be continuous. In most cases of p...
144
Voted
COMPGEOM
2004
ACM
15 years 9 months ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...