Sciweavers

4114 search results - page 333 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
JSCIC
2008
58views more  JSCIC 2008»
15 years 6 months ago
A Local Semi-Implicit Level-Set Method for Interface Motion
Abstract This paper proposes and implements a novel hybrid level set method which combines the numerical efficiency of the local level set approach with the temporal stability affo...
David Salac, Wei Lu
DKE
2002
107views more  DKE 2002»
15 years 6 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
ICTAI
2008
IEEE
16 years 1 months ago
FIP: A Fast Planning-Graph-Based Iterative Planner
We present a fast iterative planner (FIP) that aims to handle planning problems involving nondeterministic actions. In contrast to existing iterative planners, FIP is built upon G...
Jicheng Fu, Farokh B. Bastani, Vincent Ng, I-Ling ...
IPPS
1999
IEEE
15 years 11 months ago
Mapping Media Streams onto a Network of Servers
This paper presents the definition as well as a number of methods for the solution of a new combinatorial optimization problem, called S-MAMP that has to be solved for the efficie...
Reinhard Lüling
179
Voted
CVPR
2003
IEEE
16 years 8 months ago
Mean-shift Blob Tracking through Scale Space
The mean-shift algorithm is an efficient technique for tracking 2D blobs through an image. Although the scale of the mean-shift kernel is a crucial parameter, there is presently n...
Robert T. Collins