Sciweavers

4541 search results - page 115 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
VIIP
2001
15 years 18 days ago
Salient Frame Extraction for Structure from Motion
We propose a key frame extraction mechanism to aid the Structure from Motion (SfM) problem when dealing with image sequences from video cameras. Due to high frame rates (15 frames...
Anthony Whitehead, Gerhard Roth
INFORMATICALT
2007
127views more  INFORMATICALT 2007»
14 years 11 months ago
Composition of Loop Modules in the Structural Blanks Approach to Programming with Recurrences: A Task of Synthesis of Nested Loo
The paper presents, first, the Structural Blanks (SB) approach, then a method to compose loop programs. SB is an approach for expressing computations based on recurrence relations...
Vytautas Cyras
KDD
2008
ACM
178views Data Mining» more  KDD 2008»
15 years 11 months ago
Training structural svms with kernels using sampled cuts
Discriminative training for structured outputs has found increasing applications in areas such as natural language processing, bioinformatics, information retrieval, and computer ...
Chun-Nam John Yu, Thorsten Joachims
TACAS
2007
Springer
74views Algorithms» more  TACAS 2007»
15 years 5 months ago
Shape Analysis by Graph Decomposition
Abstract. Programs commonly maintain multiple linked data structures. Correlations between multiple data structures may often be nonexistent or irrelevant to verifying that the pro...
Roman Manevich, Josh Berdine, Byron Cook, G. Ramal...
SODA
2010
ACM
144views Algorithms» more  SODA 2010»
14 years 9 months ago
Cell-Probe Lower Bounds for Succinct Partial Sums
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
Mihai Patrascu, Emanuele Viola