Sciweavers

2550 search results - page 333 / 510
» The Meaning of Open Standards
Sort
View
TCC
2009
Springer
141views Cryptology» more  TCC 2009»
15 years 11 months ago
Weak Verifiable Random Functions
Verifiable random functions (VRFs), introduced by Micali, Rabin and Vadhan, are pseudorandom functions in which the owner of the seed produces a public-key that constitutes a commi...
Zvika Brakerski, Shafi Goldwasser, Guy N. Rothblum...
KDD
2006
ACM
222views Data Mining» more  KDD 2006»
15 years 11 months ago
A component-based framework for knowledge discovery in bioinformatics
Motivation: In the field of bioinformatics there is an emerging need to integrate all knowledge discovery steps into a standardized modular framework. Indeed, component-based deve...
Julien Etienne, Bernd Wachmann, Lei Zhang
ICALP
2009
Springer
15 years 11 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
SODA
2010
ACM
231views Algorithms» more  SODA 2010»
15 years 8 months ago
Asymmetric Traveling Salesman Path and Directed Latency Problems
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
Zachary Friggstad, Mohammad R. Salavatipour, Zoya ...
ICWS
2009
IEEE
15 years 8 months ago
Wrap Scientific Applications as WSRF Grid Services Using gRAVI
— Web service models are increasingly being used in the Grid community as way to create distributed applications exposing data and/or applications through self describing interfa...
Kyle Chard, Wei Tan, Joshua Boverhof, Ravi K. Madd...