Sciweavers

112 search results - page 10 / 23
» A Combinatorial Approach to Measuring Anonymity
Sort
View
IDEAS
2005
IEEE
109views Database» more  IDEAS 2005»
14 years 29 days ago
Efficient Relational Joins with Arithmetic Constraints on Multiple Attributes
We introduce and study a new class of queries that we refer to as ACMA (arithmetic constraints on multiple attributes) queries. Such combinatorial queries require the simultaneous...
Chuang Liu, Lingyun Yang, Ian T. Foster
CCS
2004
ACM
14 years 23 days ago
Parallel mixing
Efforts to design faster synchronous mix networks have focused on reducing the computational cost of mixing per server. We propose a different approach: our re-encryption mixnet...
Philippe Golle, Ari Juels
SAGA
2009
Springer
14 years 1 months ago
Scenario Reduction Techniques in Stochastic Programming
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
Werner Römisch
ACL
2007
13 years 8 months ago
Supertagged Phrase-Based Statistical Machine Translation
Until quite recently, extending Phrase-based Statistical Machine Translation (PBSMT) with syntactic structure caused system performance to deteriorate. In this work we show that i...
Hany Hassan, Khalil Sima'an, Andy Way
KDD
2004
ACM
145views Data Mining» more  KDD 2004»
14 years 22 days ago
A graph-theoretic approach to extract storylines from search results
We present a graph-theoretic approach to discover storylines from search results. Storylines are windows that offer glimpses into interesting themes latent among the top search re...
Ravi Kumar, Uma Mahadevan, D. Sivakumar