Sciweavers

2107 search results - page 364 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
BMCBI
2007
164views more  BMCBI 2007»
13 years 9 months ago
SEARCHPATTOOL: a new method for mining the most specific frequent patterns for binding sites with application to prokaryotic DNA
Background: Computational methods to predict transcription factor binding sites (TFBS) based on exhaustive algorithms are guaranteed to find the best patterns but are often limite...
Fathi Elloumi, Martha Nason
WWW
2002
ACM
14 years 9 months ago
Improvements in practical aspects of optimally scheduling web advertising
We addressed two issues concerning the practical aspects of optimally scheduling web advertising proposed by Langheinrich et al. [5], which scheduling maximizes the total number o...
Atsuyoshi Nakamura
VLSID
2008
IEEE
133views VLSI» more  VLSID 2008»
14 years 9 months ago
Exhaustive Enumeration of Legal Custom Instructions for Extensible Processors
Today's customizable processors allow the designer to augment the base processor with custom accelerators. By choosing appropriate set of accelerators, designer can significa...
Nagaraju Pothineni, Anshul Kumar, Kolin Paul
PERCOM
2007
ACM
14 years 8 months ago
Structural Learning of Activities from Sparse Datasets
Abstract. A major challenge in pervasive computing is to learn activity patterns, such as bathing and cleaning from sensor data. Typical sensor deployments generate sparse datasets...
Fahd Albinali, Nigel Davies, Adrian Friday
IEEEPACT
2008
IEEE
14 years 3 months ago
Mars: a MapReduce framework on graphics processors
We design and implement Mars, a MapReduce framework, on graphics processors (GPUs). MapReduce is a distributed programming framework originally proposed by Google for the ease of ...
Bingsheng He, Wenbin Fang, Qiong Luo, Naga K. Govi...