Sciweavers

5962 search results - page 150 / 1193
» Efficient Clustering for Orders
Sort
View
CIKM
2008
Springer
15 years 8 months ago
Retrievability: an evaluation measure for higher order information access tasks
Evaluation in Information Retrieval (IR) has long focused on effectiveness and efficiency. However, new and emerging access tasks now demand alternative evaluation measures which ...
Leif Azzopardi, Vishwa Vinay
OPODIS
2008
15 years 8 months ago
Ordering-Based Semantics for Software Transactional Memory
It has been widely suggested that memory transactions should behave as if they acquired and released a single global lock. Unfortunately, this behavior can be expensive to achieve...
Michael F. Spear, Luke Dalessandro, Virendra J. Ma...
BDA
2004
15 years 8 months ago
Indexing XML Objects with Ordered Schema Trees
: XML DBMSs require new indexing techniques to efficiently process structural search and full-text search as integrated in XQuery. Much research has been done for indexing XML docu...
Laurent Yeh, Georges Gardarin
AAAI
1994
15 years 7 months ago
Derivation Replay for Partial-Order Planning
Derivation replay was first proposed by Carbonell as a method of transferring guidancefrom a previousproblemsolving episode to a new one. Subsequent implementations have used stat...
Laurie H. Ihrig, Subbarao Kambhampati
CHES
2010
Springer
159views Cryptology» more  CHES 2010»
15 years 7 months ago
Provably Secure Higher-Order Masking of AES
Implementations of cryptographic algorithms are vulnerable to Side Channel Analysis (SCA). To counteract it, masking schemes are usually involved which randomize key-dependent data...
Matthieu Rivain, Emmanuel Prouff