Sciweavers

178 search results - page 5 / 36
» Computing Longest Previous Factor in linear time and applica...
Sort
View
ACL
2006
13 years 8 months ago
Factoring Synchronous Grammars by Sorting
Synchronous Context-Free Grammars (SCFGs) have been successfully exploited as translation models in machine translation applications. When parsing with an SCFG, computational comp...
Daniel Gildea, Giorgio Satta, Hao Zhang
ALGORITHMICA
2011
13 years 2 months ago
An Approximation Algorithm for Binary Searching in Trees
We consider the problem of computing efficient strategies for searching in trees. As a generalization of the classical binary search for ordered lists, suppose one wishes to find...
Eduardo Sany Laber, Marco Molinaro
DAC
2009
ACM
14 years 1 days ago
Xquasher: a tool for efficient computation of multiple linear expressions
— Digital signal processing applications often require the computation of linear systems. These computations can be considerably expensive and require optimizations for lower pow...
Arash Arfaee, Ali Irturk, Nikolay Laptev, Farzan F...
KDD
2009
ACM
188views Data Mining» more  KDD 2009»
14 years 8 months ago
Mining discrete patterns via binary matrix factorization
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
Bao-Hong Shen, Shuiwang Ji, Jieping Ye
ISBI
2007
IEEE
14 years 1 months ago
Real-Time Mutual-Information-Based Linear Registration on the Cell Broadband Engine Processor
Emerging multi-core processors are able to accelerate medical imaging applications by exploiting the parallelism available in their algorithms. We have implemented a mutual-inform...
Moriyoshi Ohara, Hangu Yeo, Frank Savino, Giridhar...