Sciweavers

1632 search results - page 38 / 327
» On special numberings of hypergraphs
Sort
View
ICDE
2011
IEEE
241views Database» more  ICDE 2011»
14 years 10 months ago
Advanced search, visualization and tagging of sensor metadata
— As sensors continue to proliferate, the capabilities of effectively querying not only sensor data but also its metadata becomes important in a wide range of applications. This ...
Ioannis K. Paparrizos, Hoyoung Jeung, Karl Aberer
LOPSTR
2009
Springer
16 years 25 days ago
Towards Just-In-Time Partial Evaluation of Prolog
Abstract. We introduce a just-in-time specializer for Prolog. Just-intime specialization attempts to unify of the concepts and benefits of partial evaluation (PE) and just-in-time...
Carl Friedrich Bolz, Michael Leuschel, Armin Rigo
RSA
2006
91views more  RSA 2006»
15 years 6 months ago
Average case analysis of the Boyer-Moore algorithm
Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a ra...
Tsung-Hsi Tsai
MOC
2010
15 years 1 months ago
Factorization with genus 2 curves
The elliptic curve method (ECM) is one of the best factorization methods available. It is possible to use hyperelliptic curves instead of elliptic curves but it is in theory slower...
Romain Cosset
CRYPTO
2012
Springer
262views Cryptology» more  CRYPTO 2012»
13 years 8 months ago
Functional Encryption with Bounded Collusions via Multi-party Computation
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee