Sciweavers

173 search results - page 34 / 35
» Efficient One-Round Key Exchange in the Standard Model
Sort
View
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
13 years 6 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
FSE
2009
Springer
118views Cryptology» more  FSE 2009»
14 years 6 months ago
Enhanced Target Collision Resistant Hash Functions Revisited
Enhanced Target Collision Resistance (eTCR) property for a hash function was put forth by Halevi and Krawczyk in Crypto 2006, in conjunction with the randomized hashing mode that i...
Mohammad Reza Reyhanitabar, Willy Susilo, Yi Mu
APPROX
2010
Springer
188views Algorithms» more  APPROX 2010»
13 years 7 months ago
Approximation Algorithms for Reliable Stochastic Combinatorial Optimization
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
Evdokia Nikolova
MOBISYS
2010
ACM
13 years 8 months ago
PRISM: platform for remote sensing using smartphones
To realize the potential of opportunistic and participatory sensing using mobile smartphones, a key challenge is ensuring the ease of developing and deploying such applications, w...
Tathagata Das, Prashanth Mohan, Venkata N. Padmana...
ICCV
1999
IEEE
14 years 8 months ago
United Snakes
Since their debut in 1987, snakes (active contour models) have become a standard image analysis technique with several variants now in common use. We present a framework called ``...
Jianming Liang, Tim McInerney, Demetri Terzopoulos