Sciweavers

2621 search results - page 446 / 525
» Generalized Algorithms for Constructing Statistical Language...
Sort
View
IEICET
2006
108views more  IEICET 2006»
13 years 7 months ago
Plaintext Simulatability
We propose a new security class, called plaintext-simulatability, defined over the public-key encryption schemes. The notion of plaintext simulatability (denoted PS) is similar to ...
Eiichiro Fujisaki
STACS
2012
Springer
12 years 3 months ago
On Computing Pareto Stable Assignments
Assignment between two parties in a two-sided matching market has been one of the central questions studied in economics, due to its extensive applications, focusing on different...
Ning Chen
GIS
2007
ACM
14 years 8 months ago
Approximate order-k Voronoi cells over positional streams
Handling streams of positional updates from numerous moving objects has become a challenging task for many monitoring applications. Several algorithms have been recently proposed ...
Kostas Patroumpas, Theofanis Minogiannis, Timos K....
ICML
2007
IEEE
14 years 8 months ago
Learning a meta-level prior for feature relevance from multiple related tasks
In many prediction tasks, selecting relevant features is essential for achieving good generalization performance. Most feature selection algorithms consider all features to be a p...
Su-In Lee, Vassil Chatalbashev, David Vickrey, Dap...
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
14 years 8 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...