Sciweavers

3946 search results - page 229 / 790
» The computational complexity of choice sets
Sort
View
KI
2009
Springer
16 years 1 months ago
Robust Processing of Situated Spoken Dialogue
Spoken dialogue is notoriously hard to process with standard language processing technologies. Dialogue systems must indeed meet two major challenges. First, natural spoken dialogu...
Pierre Lison, Geert-Jan M. Kruijff
ICDM
2007
IEEE
132views Data Mining» more  ICDM 2007»
16 years 1 months ago
Granularity Conscious Modeling for Probabilistic Databases
The convergence of embedded sensor systems and stream query processing suggests an important role for database techniques, in managing data that only partially – and often inacc...
Eirinaios Michelakis, Daisy Zhe Wang, Minos N. Gar...
CCS
2007
ACM
16 years 26 days ago
Do background images improve "draw a secret" graphical passwords?
Draw a secret (DAS) is a representative graphical password scheme. Rigorous theoretical analysis suggests that DAS supports an overall password space larger than that of the ubiqu...
Paul Dunphy, Jeff Yan
ACSAC
2005
IEEE
16 years 9 days ago
A Host-Based Approach to Network Attack Chaining Analysis
The typical means by which an attacker breaks into a network is through a chain of exploits, where each exploit in the chain lays the groundwork for subsequent exploits. Such a ch...
Paul Ammann, Joseph Pamula, Julie A. Street, Ronal...
GECCO
2005
Springer
162views Optimization» more  GECCO 2005»
16 years 6 days ago
An autonomous explore/exploit strategy
In reinforcement learning problems it has been considered that neither exploitation nor exploration can be pursued exclusively without failing at the task. The optimal balance bet...
Alex McMahon, Dan Scott, William N. L. Browne