Sciweavers

10051 search results - page 43 / 2011
» A Dynamic Separator Algorithm
Sort
View
SODA
2003
ACM
139views Algorithms» more  SODA 2003»
15 years 1 months ago
Compact representations of separable graphs
We consider the problem of representing graphs compactly while supporting queries efficiently. In particular we describe a data structure for representing n-vertex unlabeled graph...
Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
ICCSA
2004
Springer
15 years 5 months ago
Molecular Simulation of Reaction and Adsorption in Nanochemical Devices: Increase of Reaction Conversion by Separation of a Prod
We present a novel simulation tool to study fluid mixtures that are simultaneously chemically reacting and adsorbing within a molecularly porous material. The method is a combinat...
William R. Smith, Martin Lísal
107
Voted
CORR
2010
Springer
147views Education» more  CORR 2010»
14 years 9 months ago
RAFDA: A Policy-Aware Middleware Supporting the Flexible Separation of Application Logic from Distribution
Middleware technologies often limit the way in which object classes may be used in distributed applications due to the fixed distribution policies that they impose. These policies...
Scott M. Walker, Alan Dearle, Stuart J. Norcross, ...
96
Voted
ICA
2007
Springer
15 years 6 months ago
Blind Instantaneous Noisy Mixture Separation with Best Interference-Plus-Noise Rejection
Abstract. In this paper, a variant of the well known algorithm FastICA is proposed to be used for blind source separation in off-line (block processing) setup and a noisy environm...
Zbynek Koldovský, Petr Tichavský
100
Voted
ICRA
2009
IEEE
150views Robotics» more  ICRA 2009»
15 years 7 months ago
Flow separation for fast and robust stereo odometry
— Separating sparse flow provides fast and robust stereo visual odometry that deals with nearly degenerate situations that often arise in practical applications. We make use of ...
Michael Kaess, Kai Ni, Frank Dellaert