Sciweavers

2188 search results - page 95 / 438
» Instance-Optimal Geometric Algorithms
Sort
View
SIAMNUM
2010
126views more  SIAMNUM 2010»
14 years 9 months ago
Solving BSDE with Adaptive Control Variate
We present and analyze an algorithm to solve numerically BSDEs based on Picard's iterations and on a sequential control variate technique. Its convergence is geometric. Moreov...
Emmanuel Gobet, Céline Labart
102
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Approximate nearest-subspace representations for sound mixtures
In this paper we present a novel approach to describe sound mixtures which is based on a geometric viewpoint. In this approach we extend the idea of a nearest-neighbor representat...
Paris Smaragdis
CVPR
2005
IEEE
16 years 4 months ago
Optimal Point Correspondence through the Use of Rank Constraints
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
João Costeira, João Xavier, Ricardo ...
DATE
2007
IEEE
98views Hardware» more  DATE 2007»
15 years 8 months ago
Simulation-based reusable posynomial models for MOS transistor parameters
We present an algorithm to automatically design posynomial models for parameters of the MOS transistors using simulation data. These models improve the accuracy of the Geometric P...
Varun Aggarwal, Una-May O'Reilly
KIVS
2005
Springer
15 years 8 months ago
A Case for Lightweight SuperPeer Topologies
: The usage of SuperPeers has been proposed to improve the performance of both Structured and Unstructured Peer-to-Peer (P2P) networks. In this paper we explore a network-aware cla...
Michael Kleis, Eng Keong Lua, Xiaoming Zhou