Sciweavers

4047 search results - page 724 / 810
» The Discrete Basis Problem
Sort
View
151
Voted
CP
2000
Springer
15 years 8 months ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen
146
Voted
PODS
1999
ACM
151views Database» more  PODS 1999»
15 years 8 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin
153
Voted
ICCV
1999
IEEE
15 years 8 months ago
Epipolar Geometry Estimation by Tensor Voting in 8D
We present a novel, efficient, initializationfree approach to the problem of epipolar geometry estimation, by formulating it as one of hyperplane inference from a sparse and noisy...
Chi-Keung Tang, Gérard G. Medioni, Mi-Suen ...
136
Voted
ICIP
1999
IEEE
15 years 8 months ago
Motion Segmentation with Level Sets
Segmentation of motion in an image sequence is one of the most challenging problems in image processing, while at the same time one that finds numerous applications. To date, a wea...
Abdol-Reza Mansouri, Janusz Konrad
138
Voted
STOC
1993
ACM
123views Algorithms» more  STOC 1993»
15 years 7 months ago
Constructing small sample spaces satisfying given constraints
Abstract. The subject of this paper is nding small sample spaces for joint distributions of n discrete random variables. Such distributions are often only required to obey a certa...
Daphne Koller, Nimrod Megiddo