Sciweavers

11345 search results - page 358 / 2269
» Foundations of Computer Science
Sort
View
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
15 years 10 months ago
Privacy Amplification with Asymptotically Optimal Entropy Loss
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...
Nishanth Chandran, Bhavana Kanukurthi, Rafail Ostr...
BMCBI
2010
154views more  BMCBI 2010»
15 years 6 months ago
An eScience-Bayes strategy for analyzing omics data
Background: The omics fields promise to revolutionize our understanding of biology and biomedicine. However, their potential is compromised by the challenge to analyze the huge da...
Martin Eklund, Ola Spjuth, Jarl E. S. Wikberg
COMPGEOM
2003
ACM
15 years 12 months ago
Controlled perturbation for arrangements of circles
Given a collection C of circles in the plane, we wish to construct the arrangement A(C) (namely the subdivision of the plane into vertices, edges and faces induced by C) using fl...
Dan Halperin, Eran Leiserowitz
COMPGEOM
2004
ACM
15 years 10 months ago
Continuous path verification in multi-axis NC-machining
We introduce a new approach to the problem of collision detection between a rotating milling-cutter of an NC-machine and a model of a solid workpiece, as the rotating cutter conti...
Ron Wein, Oleg Ilushin, Gershon Elber, Dan Halperi...
CADE
2006
Springer
16 years 7 months ago
CEL - A Polynomial-Time Reasoner for Life Science Ontologies
CEL (Classifier for EL) is a reasoner for the small description logic EL+ which can be used to compute the subsumption hierarchy induced by EL+ ontologies. The most distinguishing ...
Franz Baader, Carsten Lutz, Boontawee Suntisrivara...