Sciweavers

3972 search results - page 404 / 795
» Cosparse analysis modeling - uniqueness and algorithms
Sort
View
COMPGEOM
2004
ACM
15 years 11 months ago
Inner and outer rounding of set operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementa...
Olivier Devillers, Philippe Guigue
SIGCOMM
2004
ACM
15 years 11 months ago
Optimizing cost and performance for multihoming
Multihoming is often used by large enterprises and stub ISPs to connect to the Internet. In this paper, we design a series of novel smart routing algorithms to optimize cost and p...
David Kiyoshi Goldenberg, Lili Qiu, Haiyong Xie 00...
TEC
2002
183views more  TEC 2002»
15 years 5 months ago
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
Abstract--The particle swarm is an algorithm for finding optimal regions of complex search spaces through the interaction of individuals in a population of particles. Even though t...
Maurice Clerc, James Kennedy
IJPP
2010
137views more  IJPP 2010»
15 years 4 months ago
Parallel Option Price Valuations with the Explicit Finite Difference Method
Abstract. We show how computations such as those involved in American or European-style option price valuations with the explicit finite difference method can be performed in par...
Alexandros V. Gerbessiotis
INFOCOM
2009
IEEE
16 years 20 days ago
Capacity of Arbitrary Wireless Networks
— In this work we study the problem of determining the throughput capacity of a wireless network. We propose a scheduling algorithm to achieve this capacity within an approximati...
Olga Goussevskaia, Roger Wattenhofer, Magnú...