Sciweavers

425 search results - page 82 / 85
» On the additive constant of the k-server Work Function Algor...
Sort
View
BMCBI
2002
131views more  BMCBI 2002»
13 years 7 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida
CIKM
2010
Springer
13 years 6 months ago
Preference query evaluation over expensive attributes
Most database systems allow query processing over attributes that are derived at query runtime (e.g., user-defined functions and remote data calls to web services), making them e...
Justin J. Levandoski, Mohamed F. Mokbel, Mohamed E...
WABI
2010
Springer
178views Bioinformatics» more  WABI 2010»
13 years 6 months ago
Haplotype Inference on Pedigrees with Recombinations and Mutations
Abstract. Haplotype Inference (HI) is a computational challenge of crucial importance in a range of genetic studies, such as functional genomics, pharmacogenetics and population ge...
Yuri Pirola, Paola Bonizzoni, Tao Jiang
IUI
2006
ACM
14 years 1 months ago
Linking messages and form requests
Large organizations with sophisticated infrastructures have large form-based systems that manage the interaction between the user community and the infrastructure. In many cases, ...
Anthony Tomasic, John Zimmerman, Isaac Simmons
MICRO
2005
IEEE
126views Hardware» more  MICRO 2005»
14 years 1 months ago
Cost Sensitive Modulo Scheduling in a Loop Accelerator Synthesis System
Scheduling algorithms used in compilers traditionally focus on goals such as reducing schedule length and register pressure or producing compact code. In the context of a hardware...
Kevin Fan, Manjunath Kudlur, Hyunchul Park, Scott ...