Sciweavers

1272 search results - page 202 / 255
» Approximate Parameterized Matching
Sort
View
346
Voted
ICA
2012
Springer
13 years 11 months ago
On Revealing Replicating Structures in Multiway Data: A Novel Tensor Decomposition Approach
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...
Anh Huy Phan, Andrzej Cichocki, Petr Tichavsk&yacu...
ICCV
1999
IEEE
16 years 5 months ago
Stereo Reconstruction from Multiperspective Panoramas
A new approach to computing a panoramic (360 degrees) depth map is presented in this paper. Our approach uses a large collection of images taken by a camera whose motion has been c...
Heung-Yeung Shum, Richard Szeliski
165
Voted
BMCBI
2008
208views more  BMCBI 2008»
15 years 3 months ago
GraphFind: enhancing graph searching by low support data mining techniques
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
Alfredo Ferro, Rosalba Giugno, Misael Mongiov&igra...
143
Voted
SIAMCOMP
2002
152views more  SIAMCOMP 2002»
15 years 3 months ago
Maintaining Stream Statistics over Sliding Windows
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
Mayur Datar, Aristides Gionis, Piotr Indyk, Rajeev...
188
Voted
ICALP
2011
Springer
14 years 7 months ago
Vertex Cover in Graphs with Locally Few Colors
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
Fabian Kuhn, Monaldo Mastrolilli