Sciweavers

6365 search results - page 387 / 1273
» Fast Local Computation Algorithms
Sort
View
CVPR
2001
IEEE
16 years 9 months ago
Learning Spatially Localized, Parts-Based Representation
In this paper, we propose a novel method, called local nonnegative matrix factorization (LNMF), for learning spatially localized, parts-based subspace representation of visual pat...
Stan Z. Li, XinWen Hou, HongJiang Zhang, QianSheng...
EMMCVPR
2009
Springer
16 years 2 months ago
Locally Parallel Textures Modeling with Adapted Hilbert Spaces
This article 3 presents a new adaptive texture model. Locally parallel oscillating patterns are modeled with a weighted Hilbert space defined over local Fourier coefficients. The ...
Pierre Maurel, Jean-François Aujol, Gabriel...
237
Voted
GRC
2010
IEEE
15 years 8 months ago
Local Pattern Mining from Sequences Using Rough Set Theory
Abstract--Sequential pattern mining is a crucial but challenging task in many applications, e.g., analyzing the behaviors of data in transactions and discovering frequent patterns ...
Ken Kaneiwa, Yasuo Kudo
IPCCC
2005
IEEE
16 years 1 months ago
Dynamic localization control for mobile sensor networks
Localization is a fundamental operation in mobile and self-configuring networks such as sensor networks and mobile ad hoc networks. For example, sensor location is often critical...
Sameer Tilak, Vinay Kolar, Nael B. Abu-Ghazaleh, K...
192
Voted
ALMOB
2008
95views more  ALMOB 2008»
15 years 7 months ago
A stitch in time: Efficient computation of genomic DNA melting bubbles
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
Eivind Tøstesen