Sciweavers

5326 search results - page 179 / 1066
» On what we can ensure
Sort
View
EUROCRYPT
2005
Springer
15 years 12 months ago
On Robust Combiners for Oblivious Transfer and Other Primitives
A (1,2)-robust combiner for a cryptographic primitive P is a construction that takes two candidate schemes for P and combines them into one scheme that securely implement P even i...
Danny Harnik, Joe Kilian, Moni Naor, Omer Reingold...
FSTTCS
2010
Springer
15 years 4 months ago
One-Counter Stochastic Games
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
Tomás Brázdil, Václav Brozek,...
ICDE
2008
IEEE
157views Database» more  ICDE 2008»
16 years 7 months ago
Querying and Managing Provenance through User Views in Scientific Workflows
Abstract-- Workflow systems have become increasingly popular for managing experiments where many bioinformatics tasks are chained together. Due to the large amount of data generate...
Olivier Biton, Sarah Cohen Boulakia, Susan B. Davi...
INFOCOM
2007
IEEE
16 years 23 days ago
Information Survival Threshold in Sensor and P2P Networks
— Consider a network of, say, sensors, or P2P nodes, or bluetooth-enabled cell-phones, where nodes transmit information to each other and where links and nodes can go up or down....
Deepayan Chakrabarti, Jure Leskovec, Christos Falo...
DAWAK
2004
Springer
15 years 12 months ago
Inductive Databases as Ranking
Abstract. Most of the research in data mining has been focused on developing novel algorithms for specific data mining tasks. However, finding the theoretical foundations of data...
Taneli Mielikäinen