Sciweavers

4403 search results - page 93 / 881
» Galois Theory of Algorithms
Sort
View
TSP
2008
117views more  TSP 2008»
15 years 6 months ago
A Theory for Sampling Signals From a Union of Subspaces
One of the fundamental assumptions in traditional sampling theorems is that the signals to be sampled come from a single vector space (e.g. bandlimited functions). However, in many...
Yue M. Lu, Minh N. Do
TROB
2002
121views more  TROB 2002»
15 years 5 months ago
Adaptive force control of position/velocity controlled robots: theory and experiment
This paper addresses the problem of achieving exact dynamic force control with manipulators possessing the low-level position and/or velocity controllers typically employed in indu...
Jaydeep Roy, Louis L. Whitcomb
TVCG
2010
157views more  TVCG 2010»
15 years 4 months ago
Crease Surfaces: From Theory to Extraction and Application to Diffusion Tensor MRI
—Crease surfaces are two-dimensional manifolds along which a scalar field assumes a local maximum (ridge) or a local minimum (valley) in a constrained space. Unlike isosurfaces, ...
Thomas Schultz, Holger Theisel, Hans-Peter Seidel
ALDT
2009
Springer
144views Algorithms» more  ALDT 2009»
16 years 24 days ago
Aggregating Interval Orders by Propositional Optimization
Aggregating preferences for finding a consensus between several agents is an important issue in many fields, like economics, decision theory and artificial intelligence. In this...
Daniel Le Berre, Pierre Marquis, Meltem Özt&u...
EC
2007
167views ECommerce» more  EC 2007»
15 years 6 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud