Sciweavers

14548 search results - page 2711 / 2910
» The Optimal Path-Matching Problem
Sort
View
LICS
1997
IEEE
15 years 10 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
173
Voted
CSE
2009
IEEE
15 years 10 months ago
A Comparative Study of Blocking Storage Methods for Sparse Matrices on Multicore Architectures
Sparse Matrix-Vector multiplication (SpMV) is a very challenging computational kernel, since its performance depends greatly on both the input matrix and the underlying architectur...
Vasileios Karakasis, Georgios I. Goumas, Nectarios...
ALGOSENSORS
2009
Springer
15 years 9 months ago
Routing on Delay Tolerant Sensor Networks
Abstract. Delay (or disruption) tolerant sensor networks may be modeled as Markovian evolving graphs [1]. We present experimental evidence showing that considering multiple (possib...
Michael Keane, Evangelos Kranakis, Danny Krizanc, ...
CVPR
2009
IEEE
15 years 9 months ago
Nonlinear Nonnegative Component Analysis
In this paper general solutions for Nonlinear Nonnegative Component Analysis for data representation and recognition are proposed. That is, motivated by a combination of the Nonne...
Stefanos Zafeiriou, Maria Petrou
CVPR
2010
IEEE
15 years 9 months ago
Multi-View Scene Flow Estimation: A View Centered Variational Approach
We present a novel method for recovering the 3D structure and scene flow from calibrated multi-view sequences. We propose a 3D point cloud parametrization of the 3D structure and ...
Tali Bahsa, Yael Moses, Nahum Kiryati
« Prev « First page 2711 / 2910 Last » Next »