Sciweavers

151 search results - page 26 / 31
» Notes on conditional previsions
Sort
View
FAST
2008
13 years 9 months ago
Portably Solving File TOCTTOU Races with Hardness Amplification
The file-system API of contemporary systems makes programs vulnerable to TOCTTOU (time of check to time of use) race conditions. Existing solutions either help users to detect the...
Dan Tsafrir, Tomer Hertz, David Wagner, Dilma Da S...
WSC
2001
13 years 8 months ago
Choosing among seven bases
In this paper, the selection of a BASE Case was every bit as important as the simulation itself. The production team had been familiar with simulations and had used their results ...
Stuart Gittlitz
DC
2007
13 years 7 months ago
On private computation in incomplete networks
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
Amos Beimel
EDM
2010
154views Data Mining» more  EDM 2010»
13 years 6 months ago
Can We Get Better Assessment From A Tutoring System Compared to Traditional Paper Testing? Can We Have Our Cake (Better Assessme
Dynamic assessment (DA) has been advocated as an interactive approach to conduct assessments to students in the learning systems as it can differentiate student proficiency at a fi...
Mingyu Feng, Neil T. Heffernan
FOCS
2010
IEEE
13 years 5 months ago
Stability Yields a PTAS for k-Median and k-Means Clustering
We consider k-median clustering in finite metric spaces and k-means clustering in Euclidean spaces, in the setting where k is part of the input (not a constant). For the k-means pr...
Pranjal Awasthi, Avrim Blum, Or Sheffet