Sciweavers

6110 search results - page 379 / 1222
» Approximate Computing
Sort
View
DATESO
2007
157views Database» more  DATESO 2007»
15 years 8 months ago
Index-Based Approach to Similarity Search in Protein and Nucleotide Databases
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
David Hoksza, Tomás Skopal
ECCC
2008
108views more  ECCC 2008»
15 years 6 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
ANOR
2004
122views more  ANOR 2004»
15 years 6 months ago
Call Center Staffing with Simulation and Cutting Plane Methods
We present an iterative cutting plane method for minimizing staffing costs in a service system subject to satisfying acceptable service level requirements over multiple time perio...
Júlíus Atlason, Marina A. Epelman, S...
CORR
2010
Springer
155views Education» more  CORR 2010»
15 years 1 months ago
A Complexity View of Markets with Social Influence
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...
Xi Chen, Shang-Hua Teng
DCC
2004
IEEE
15 years 10 months ago
Joint Source-Channel Decoding of Quasi-Arithmetic Codes
This paper addresses the issue of robust and joint source-channel decoding of quasiarithmetic codes. Quasi-arithmetic coding is a reduced precision and complexity implementation o...
Thomas Guionnet, Christine Guillemot