Sciweavers

6315 search results - page 332 / 1263
» Approximating Solution Structure
Sort
View
COR
2007
108views more  COR 2007»
15 years 6 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian
SIGMOD
2011
ACM
247views Database» more  SIGMOD 2011»
14 years 9 months ago
Collective spatial keyword querying
With the proliferation of geo-positioning and geo-tagging, spatial web objects that possess both a geographical location and a textual description are gaining in prevalence, and s...
Xin Cao, Gao Cong, Christian S. Jensen, Beng Chin ...
SIAMCO
2010
169views more  SIAMCO 2010»
15 years 1 months ago
Shape Derivative of Drag Functional
Abstract. In the paper compressible, stationary Navier-Stokes (N-S) equations are considered. The model is well-posed, there exist weak solutions in bounded domains, subject to inh...
Pavel I. Plotnikov, Jan Sokolowski
ICRA
2007
IEEE
146views Robotics» more  ICRA 2007»
16 years 1 months ago
Crowds of Moving Objects: Navigation Planning and Simulation
Abstract— This paper presents a solution to interactive navigation planning and real-time simulation of a very large number of entities moving in a virtual environment. From the ...
Julien Pettré, Helena Grillon, Daniel Thalm...
SODA
2010
ACM
175views Algorithms» more  SODA 2010»
16 years 4 months ago
Fast SDP Algorithms for Constraint Satisfaction Problems
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
David Steurer