Sciweavers

1778 search results - page 299 / 356
» The Theory of Probabilistic Databases
Sort
View
SIGIR
2005
ACM
15 years 3 months ago
Linear discriminant model for information retrieval
This paper presents a new discriminative model for information retrieval (IR), referred to as linear discriminant model (LDM), which provides a flexible framework to incorporate a...
Jianfeng Gao, Haoliang Qi, Xinsong Xia, Jian-Yun N...
COCO
2005
Springer
150views Algorithms» more  COCO 2005»
15 years 3 months ago
The Quantum Adversary Method and Classical Formula Size Lower Bounds
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...
Sophie Laplante, Troy Lee, Mario Szegedy
GECCO
2005
Springer
186views Optimization» more  GECCO 2005»
15 years 3 months ago
Subproblem optimization by gene correlation with singular value decomposition
Several ways of using singular value decomposition (SVD), a linear algebra technique typically used for information retrieval, to decompose problems into subproblems are investiga...
Jacob G. Martin
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
15 years 3 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
HUC
2009
Springer
15 years 2 months ago
Simultaneous localization and mapping for pedestrians using only foot-mounted inertial sensors
In this paper we describe a new Bayesian estimation approach for simultaneous mapping and localization for pedestrians based on odometry with foot mounted inertial sensors. When s...
Patrick Robertson, Michael Angermann, Bernhard Kra...