Sciweavers

1268 search results - page 110 / 254
» Finding a curve in a map
Sort
View
JC
2008
96views more  JC 2008»
15 years 6 months ago
Adaptivity and computational complexity in the numerical solution of ODEs
In this paper we analyze the problem of adaptivity for one-step numerical methods for solving ODEs, both IVPs and BVPs, with a view to generating grids of minimal computational co...
Silvana Ilie, Gustaf Söderlind, Robert M. Cor...
ICWSM
2009
15 years 4 months ago
Connecting Corresponding Identities across Communities
One of the most interesting challenges in the area of social computing and social media analysis is the so-called community analysis. A well known barrier in cross-community (mult...
Reza Zafarani, Huan Liu
CDC
2010
IEEE
138views Control Systems» more  CDC 2010»
15 years 1 months ago
Consensus in non-commutative spaces
Convergence analysis of consensus algorithms is revisited in the light of the Hilbert distance. The Lyapunov function used in the early analysis by Tsitsiklis is shown to be the Hi...
Rodolphe Sepulchre, Alain Sarlette, Pierre Rouchon
TIT
2010
98views Education» more  TIT 2010»
15 years 1 months ago
QR decomposition of Laurent polynomial matrices sampled on the unit circle
Abstract--We consider Laurent polynomial (LP) matrices defined on the unit circle of the complex plane. QR decomposition of an LP matrix A(s) yields QR factors Q(s) and R(s) that, ...
Davide Cescato, Helmut Bölcskei
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
15 years 7 months ago
Robust Clustering in Arbitrarily Oriented Subspaces
In this paper, we propose an efficient and effective method to find arbitrarily oriented subspace clusters by mapping the data space to a parameter space defining the set of possi...
Elke Achtert, Christian Böhm, Jörn David...