Sciweavers

1548 search results - page 201 / 310
» Computational Approaches to Sentence Completion
Sort
View
DIM
2008
ACM
13 years 10 months ago
Quantifying the security of preference-based authentication
We describe a technique aimed at addressing longstanding problems for password reset: security and cost. In our approach, users are authenticated using their preferences. Experime...
Markus Jakobsson, Liu Yang, Susanne Wetzel
AAAI
2010
13 years 10 months ago
Probabilistic Plan Recognition Using Off-the-Shelf Classical Planners
Plan recognition is the problem of inferring the goals and plans of an agent after observing its behavior. Recently, it has been shown that this problem can be solved efficiently,...
Miquel Ramírez, Hector Geffner
BXML
2004
13 years 10 months ago
Query Reformulation for the XML standards XPath, XQuery and XSLT
: Whenever transformation of data is used to bridge the gap of different data formats, and a query is given in the destination format, query reformulation can speed up the transfor...
Sven Groppe, Stefan Böttcher
AHSWN
2010
102views more  AHSWN 2010»
13 years 9 months ago
A Framework for the Capacity Evaluation of Multihop Wireless Networks?
The specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically...
Hervé Rivano, Fabrice Theoleyre, Fabrice Va...
COR
2010
127views more  COR 2010»
13 years 9 months ago
Discrepancy search for the flexible job shop scheduling problem
The Flexible Job Shop scheduling Problem (FJSP) is a generalization of the classical Job Shop Problem in which each operation must be processed on a given machine chosen among a f...
Abir Ben Hmida, Mohamed Haouari, Marie-José...