Sciweavers

437 search results - page 14 / 88
» Adaptivity and computational complexity in the numerical sol...
Sort
View
VTC
2006
IEEE
14 years 1 months ago
Rate Adaptation in Time Varying Channels using Acknowledgement Feedback
— Throughput maximization in a packet switched wireless communication system is considered in this paper. The channel variation is accounted for by modeling the channel as a fin...
Chin Keong Ho, Job Oostveen
SIAMSC
2011
85views more  SIAMSC 2011»
12 years 10 months ago
Refinement and Connectivity Algorithms for Adaptive Discontinuous Galerkin Methods
Abstract. Adaptive multiscale methods are among the many effective techniques for the numerical solution of partial differential equations. Efficient grid management is an import...
Kolja Brix, Ralf Massjung, Alexander Voss

Presentation
2175views
15 years 8 months ago
Robust Robotic Path Planning Using Level Sets
In robotic navigation, path planning is aimed at getting the optimum collision-free path between a starting and target locations. The optimality criterion depends on the surround...
M. Sabry Hassouna
FMSD
2006
104views more  FMSD 2006»
13 years 7 months ago
Some ways to reduce the space dimension in polyhedra computations
Convex polyhedra are often used to approximate sets of states of programs involving numerical variables. The manipulation of convex polyhedra relies on the so-called double descri...
Nicolas Halbwachs, David Merchat, Laure Gonnord
CVPR
2010
IEEE
14 years 3 months ago
Curious Snakes: a minimum-latency solution to the cluttered background problem in active contours
We present a region-based active contour detection algorithm for objects that exhibit relatively homogeneous photometric characteristics (e.g. smooth color or gray levels), embe...
Ganesh Sundaramoorthi, Stefano Soatto, Anthony Yez...