3946 search results - page 706 / 790 » The computational complexity of choice sets |
211
click to vote
PRESENCE
2006
15 years 6 months ago
2006
The generation of multimodal virtual environments for surgical training is complicated by the necessity to develop heterogeneous simulation scenarios such as surgical incision, ca...
173
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
224
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
220
click to vote
NAR
2002
15 years 6 months ago
2002
The Kyoto Encyclopedia of Genes and Genomes (KEGG) is the primary database resource of the Japanese GenomeNet service (http://www.genome.ad.jp/) for understanding higher order fun...
231
click to vote
MEDIAFORENSICS
2010
15 years 4 months ago
2010
One of the critical steps in designing a secure biometric system is protecting the templates of the users that are stored either in a central database or on smart cards. If a biom...