Sciweavers

7129 search results - page 785 / 1426
» Approximation Algorithms for Treewidth
Sort
View
282
Voted
INFORMATICALT
2007
92views more  INFORMATICALT 2007»
15 years 6 months ago
An Optimization of System for Automatic Recognition of Ischemic Stroke Areas in Computed Tomography Images
Abstract. The paper considers application of stochastic optimization to system of automatic recognition of ischemic stroke area on computed tomography (CT) images. The algorithm of...
Darius Grigaitis, Vaida Bartkute, Leonidas Sakalau...
TVCG
2008
128views more  TVCG 2008»
15 years 6 months ago
AD-Frustum: Adaptive Frustum Tracing for Interactive Sound Propagation
We present an interactive algorithm to compute sound propagation paths for transmission, specular reflection and edge diffraction in complex scenes. Our formulation uses an adaptiv...
Anish Chandak, Christian Lauterbach, Micah T. Tayl...
COMPUTING
2004
107views more  COMPUTING 2004»
15 years 6 months ago
Efficient Collision Detection for Moving Ellipsoids Using Separating Planes
We present a simple, accurate and efficient algorithm for collision detection among moving ellipsoids. Its efficiency is attributed to two results: (i) a simple algebraic test for...
Wenping Wang, Yi-King Choi, Bin Chan, Myung-Soo Ki...
NJC
2000
99views more  NJC 2000»
15 years 6 months ago
An Incremental Unique Representation for Regular Trees
In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way th...
Laurent Mauborgne
197
Voted
ML
2002
ACM
168views Machine Learning» more  ML 2002»
15 years 6 months ago
On Average Versus Discounted Reward Temporal-Difference Learning
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
John N. Tsitsiklis, Benjamin Van Roy