Sciweavers

113 search results - page 13 / 23
» What can the GC compute efficiently
Sort
View
ICPR
2006
IEEE
14 years 11 months ago
Ancient Initial Letters Indexing
Discrimination of images is necessary in many tasks, either understanding or indexing for example. Here we are concerned by indexing. More precisely we are working about initial l...
Nicole Vincent, Rudolf Pareti
GRAPHICSINTERFACE
2009
13 years 7 months ago
QuickSelect: history-based selection expansion
When editing a graphical document, it is common to apply a change to multiple items at once, and a variety of tools exist for selecting sets of items. However, directly selecting ...
Sara L. Su, Sylvain Paris, Frédo Durand
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
14 years 1 months ago
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
We present the first universally verifiable voting scheme that can be based on a general assumption (existence of a non-interactive commitment scheme). Our scheme is also the first...
Tal Moran, Moni Naor
ICRA
1994
IEEE
127views Robotics» more  ICRA 1994»
14 years 1 months ago
"RISC" for Industrial Robotics: Recent Results and Open Problems
At the intersection of robotics, computational geometry, and manufacturingengineering, we have identifieda collection of research problems with near-term industrial applications. ...
John F. Canny, Kenneth Y. Goldberg
STOC
2001
ACM
119views Algorithms» more  STOC 2001»
14 years 10 months ago
Private approximation of NP-hard functions
d Abstract] Shai Halevi Robert Krauthgamer Eyal Kushilevitz Kobbi Nissim ? The notion of private approximation was introduced recently by Feigenbaum, Fong, Strauss and Wright. Inf...
Shai Halevi, Robert Krauthgamer, Eyal Kushilevitz,...