Sciweavers

1995 search results - page 323 / 399
» What's the Problem
Sort
View
111
Voted
WPES
2003
ACM
15 years 9 months ago
Secure and private sequence comparisons
We give an efficient protocol for sequence comparisons of the edit-distance kind, such that neither party reveals anything about their private sequence to the other party (other t...
Mikhail J. Atallah, Florian Kerschbaum, Wenliang D...
116
Voted
DESRIST
2009
Springer
79views Education» more  DESRIST 2009»
15 years 8 months ago
Power of peripheral designers: how users learn to design
In information system development, end-users often participate in design and in many cases learn to design their own system. Design, however, requires a distinct approach that use...
Yutaka Yamauchi
150
Voted
DATE
2004
IEEE
175views Hardware» more  DATE 2004»
15 years 7 months ago
Breaking Instance-Independent Symmetries in Exact Graph Coloring
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...
Arathi Ramani, Fadi A. Aloul, Igor L. Markov, Kare...
136
Voted
COLT
2006
Springer
15 years 7 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
147
Voted
DRM
2006
Springer
15 years 7 months ago
Securing sensitive content in a view-only file system
One of the most fundamental problems in computer security is protecting sensitive digital information from unauthorized disclosure. There are a number of challenges, such as spywa...
Kevin Borders, Xin Zhao, Atul Prakash