Sciweavers

4428 search results - page 611 / 886
» The Chow Parameters Problem
Sort
View
JSCIC
2010
101views more  JSCIC 2010»
15 years 1 months ago
Boundary-Conforming Discontinuous Galerkin Methods via Extensions from Subdomains
A new way of devising numerical methods is introduced whose distinctive feature is the computation of a finite element approximation only in a polyhedral subdomain D of the origina...
Bernardo Cockburn, Deepa Gupta, Fernando Reitich
MEMETIC
2010
311views more  MEMETIC 2010»
15 years 1 months ago
Iterated local search with Powell's method: a memetic algorithm for continuous global optimization
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
Oliver Kramer
PVLDB
2010
100views more  PVLDB 2010»
15 years 1 months ago
Efficient Proximity Detection among Mobile Users via Self-Tuning Policies
Given a set of users, their friend relationships, and a distance threshold per friend pair, the proximity detection problem is to find each pair of friends such that the Euclidean...
Man Lung Yiu, Leong Hou U, Simonas Saltenis, Kosta...
172
Voted
PVLDB
2010
135views more  PVLDB 2010»
15 years 1 months ago
Efficient Skyline Evaluation over Partially Ordered Domains
Although there has been a considerable body of work on skyline evaluation in multidimensional data with totally ordered attribute domains, there are only a few methods that consid...
Shiming Zhang, Nikos Mamoulis, Ben Kao, David Wai-...
198
Voted
SIAMIS
2010
190views more  SIAMIS 2010»
15 years 1 months ago
Analysis and Generalizations of the Linearized Bregman Method
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
Wotao Yin