Sciweavers

4536 search results - page 551 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
LISP
2008
104views more  LISP 2008»
15 years 6 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan
ICPR
2008
IEEE
16 years 8 months ago
Manifold optimisation for motion factorisation
This paper presents a novel formulation for the popular factorisation based solution for Structure from Motion. Since our measurement matrices are populated with incomplete and in...
Appu Shaji, David Suter, Sharat Chandran
ICIP
2009
IEEE
16 years 7 months ago
Corner-based Background Segmentation Using Adaptive Resonance Theory
A correct video segmentation, namely the detection of moving objects within a scene plays a very important role in many application in safety, surveillance, trafic monitoring and ...
ICML
2005
IEEE
16 years 7 months ago
Hierarchical Dirichlet model for document classification
The proliferation of text documents on the web as well as within institutions necessitates their convenient organization to enable efficient retrieval of information. Although tex...
Sriharsha Veeramachaneni, Diego Sona, Paolo Avesan...
DCC
2007
IEEE
16 years 6 months ago
Simple Linear-Time Off-Line Text Compression by Longest-First Substitution
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
Ryosuke Nakamura, Hideo Bannai, Shunsuke Inenaga, ...