Sciweavers

3244 search results - page 44 / 649
» On convex complexity measures
Sort
View
ICRA
2006
IEEE
90views Robotics» more  ICRA 2006»
15 years 5 months ago
A Performance Comparison of Three Algorithms for Proximity Queries Relative to Convex Polyhedra
— This paper presents a comparative analysis relative to the experimental performances of an asymptotically fast and incremental algorithm, recently developed to compute collisio...
Stefano Carpin, Claudio Mirolo, Enrico Pagello
SMA
2010
ACM
231views Solid Modeling» more  SMA 2010»
14 years 11 months ago
Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space
We present a novel method for fast retrieval of exact Minkowski sums of pairs of convex polytopes in R3 , where one of the polytopes keeps rotating. The algorithm is based on pre-...
Naama Mayer, Efi Fogel, Dan Halperin
IJON
2007
184views more  IJON 2007»
14 years 11 months ago
Convex incremental extreme learning machine
Unlike the conventional neural network theories and implementations, Huang et al. [Universal approximation using incremental constructive feedforward networks with random hidden n...
Guang-Bin Huang, Lei Chen
TIT
2008
51views more  TIT 2008»
14 years 11 months ago
Spectral Relations for Multidimensional Complex Improper Stationary and (Almost) Cyclostationary Processes
Abstract--We study continuous-time multidimensional widesense stationary (WSS) and (almost) cyclostationary processes in the frequency domain. Under the assumption that the correla...
Patrik Wahlberg, Peter J. Schreier
IMC
2007
ACM
15 years 26 days ago
On optimal probing for delay and loss measurement
Packet delay and loss are two fundamental measures of performance. Using active probing to measure delay and loss typically involves sending Poisson probes, on the basis of the PA...
François Baccelli, Sridhar Machiraju, Darry...