Sciweavers

778 search results - page 43 / 156
» Improved universal denominators
Sort
View
CTRSA
2012
Springer
285views Cryptology» more  CTRSA 2012»
13 years 5 months ago
Plaintext-Checkable Encryption
We study the problem of searching on encrypted data, where the search is performed using a plaintext message or a keyword, rather than a message-specific trapdoor as done by state...
Sébastien Canard, Georg Fuchsbauer, Aline G...
CVPR
2012
IEEE
13 years 4 days ago
Exemplar-based human action pose correction and tagging
The launch of Xbox Kinect has built a very successful computer vision product and made a big impact to the gaming industry; this sheds lights onto a wide variety of potential appl...
Wei Shen, Ke Deng, Xiang Bai, Tommer Leyvand, Bain...
ICALP
2007
Springer
15 years 3 months ago
Reachability-Time Games on Timed Automata
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
Marcin Jurdzinski, Ashutosh Trivedi
TREC
2008
14 years 11 months ago
External Query Expansion in the Blogosphere
: We describe the participation of the University of Amsterdam's ILPS group in the blog track at TREC 2008. We mainly explored different ways of using external corpora to expa...
Wouter Weerkamp, Maarten de Rijke
CORR
2010
Springer
163views Education» more  CORR 2010»
14 years 8 months ago
Faster Algorithms for Semi-Matching Problems
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon...