11740 search results - page 141 / 2348 » More Problems in Rewriting |
118
click to vote
SIAMCOMP
1998
15 years 14 days ago
1998
We describe a new randomized data structure, the sparse partition, for solving the dynamic closest-pair problem. Using this data structure the closest pair of a set of n points in ...
80
Voted
JSC
2010
14 years 11 months ago
2010
1 We present a solution to the conjugacy decision problem and the conjugacy search problem2 in Garside groups, which is theoretically simpler than the usual one, with no loss of eï...
109
click to vote
CDC
2009
IEEE
14 years 10 months ago
2009
IEEE
In many applicative scenarios it is important to derive information about the topology and the internal connections of more dynamical systems interacting together. Examples can be ...
123
click to vote
OR
2010
Springer
14 years 7 months ago
2010
Springer
Abstract With potential application to a variety of industries, fleet sizing problems present a prevalent and significant challenge for engineers and managers. This is especially t...
91
Voted
SIAMJO
2010
14 years 7 months ago
2010
We propose a Newton-CG primal proximal point algorithm for solving large scale log-determinant optimization problems. Our algorithm employs the essential ideas of the proximal poi...