Sciweavers

306 search results - page 32 / 62
» Fault-Tolerant Computation in the Full Information Model
Sort
View
KDD
2012
ACM
179views Data Mining» more  KDD 2012»
11 years 10 months ago
Transparent user models for personalization
Personalization is a ubiquitous phenomenon in our daily online experience. While such technology is critical for helping us combat the overload of information we face, in many cas...
Khalid El-Arini, Ulrich Paquet, Ralf Herbrich, Jur...
FC
2003
Springer
101views Cryptology» more  FC 2003»
14 years 1 months ago
Fully Private Auctions in a Constant Number of Rounds
Abstract. We present a new cryptographic auction protocol that prevents extraction of bid information despite any collusion of participants. This requirement is stronger than commo...
Felix Brandt
IROS
2009
IEEE
174views Robotics» more  IROS 2009»
14 years 2 months ago
Characterization and modeling of wireless channels for networked robotic and control systems - a comprehensive overview
— The goal of this paper is to serve as a reference for researchers in robotics and control that are interested in realistic modeling, theoretical analysis and simulation of wire...
Yasamin Mostofi, Alejandro Gonzalez-Ruiz, Alireza ...
ICML
2006
IEEE
14 years 8 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
BMCBI
2010
146views more  BMCBI 2010»
13 years 8 months ago
Genomic selection and complex trait prediction using a fast EM algorithm applied to genome-wide markers
Background: The information provided by dense genome-wide markers using high throughput technology is of considerable potential in human disease studies and livestock breeding pro...
Ross K. Shepherd, Theo H. E. Meuwissen, John A. Wo...