Sciweavers

6266 search results - page 58 / 1254
» New results on the computability and complexity of points - ...
Sort
View
SDM
2007
SIAM
133views Data Mining» more  SDM 2007»
13 years 10 months ago
Change-Point Detection using Krylov Subspace Learning
We propose an efficient algorithm for principal component analysis (PCA) that is applicable when only the inner product with a given vector is needed. We show that Krylov subspace...
Tsuyoshi Idé, Koji Tsuda
ACG
2003
Springer
14 years 2 months ago
New Games Related to Old and New Sequences
We define an infinite class of 2-pile subtraction games, where the amount that can be subtracted from both piles simultaneously, is a function f of the size of the piles. Wytho...
Aviezri S. Fraenkel
VIS
2007
IEEE
115views Visualization» more  VIS 2007»
14 years 10 months ago
Efficient Computation and Visualization of Coherent Structures in Fluid Flow Applications
Abstract--The recently introduced notion of Finite-Time Lyapunov Exponent to characterize Coherent Lagrangian Structures provides a powerful framework for the visualization and ana...
Christoph Garth, Florian Gerhardt, Xavier Tricoc...
INFOCOM
2005
IEEE
14 years 2 months ago
Time and energy complexity of distributed computation in wireless sensor networks
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...
Nilesh Khude, Anurag Kumar, Aditya Karnik
BMCBI
2008
242views more  BMCBI 2008»
13 years 9 months ago
New time-scale criteria for model simplification of bio-reaction systems
Background: Quasi-steady state approximation (QSSA) based on time-scale analysis is known to be an effective method for simplifying metabolic reaction system, but the conventional...
Junwon Choi, Kyung-won Yang, Tai-yong Lee, Sang Yu...