Sciweavers

1786 search results - page 130 / 358
» The Structure of Factor Oracles
Sort
View
SODA
2012
ACM
174views Algorithms» more  SODA 2012»
13 years 8 months ago
Using hashing to solve the dictionary problem
We consider the dictionary problem in external memory and improve the update time of the wellknown buffer tree by roughly a logarithmic factor. For any λ ≥ max{lg lg n, logM/B(...
John Iacono, Mihai Patrascu
DAWAK
2004
Springer
15 years 11 months ago
A Tree Partitioning Method for Memory Management in Association Rule Mining
All methods of association rule mining require the frequent sets of items, that occur together sufficiently often to be the basis of potentially interesting rules, to be first com...
Shakil Ahmed, Frans Coenen, Paul H. Leng
STRINGOLOGY
2008
15 years 7 months ago
Usefulness of Directed Acyclic Subword Graphs in Problems Related to Standard Sturmian Words
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
Pawel Baturo, Marcin Piatkowski, Wojciech Rytter
CVPR
2012
IEEE
13 years 8 months ago
Complex loss optimization via dual decomposition
We describe a novel max-margin parameter learning approach for structured prediction problems under certain non-decomposable performance measures. Structured prediction is a commo...
Mani Ranjbar, Arash Vahdat, Greg Mori
RECOMB
2007
Springer
16 years 16 days ago
Nucleosome Occupancy Information Improves de novo Motif Discovery
A complete understanding of transcriptional regulatory processes in the cell requires identification of transcription factor binding sites on a genomewide scale. Unfortunately, th...
Leelavati Narlikar, Raluca Gordân, Alexander...