Sciweavers

13457 search results - page 1 / 2692
» Can we elect if we cannot compare
Sort
View
SPAA
2003
ACM
13 years 10 months ago
Can we elect if we cannot compare?
Lali Barrière, Paola Flocchini, Pierre Frai...
EDM
2010
154views Data Mining» more  EDM 2010»
13 years 3 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
TCS
2008
13 years 4 months ago
Election and rendezvous with incomparable labels
In "Can we elect if we cannot compare" (SPAA'03), Barri`ere, Flocchini, Fraigniaud and Santoro consider a qualitative model of distributed computing, where the label...
Jérémie Chalopin
USS
2008
13 years 7 months ago
Administrative and Public Verifiability: Can We Have Both?
Administrative verifiability gives election officials the means to protect against certain kinds of errors and fraud. This is typically accomplished with tools like paper audit tr...
Josh Benaloh
CORR
2011
Springer
148views Education» more  CORR 2011»
12 years 11 months ago
How well can we estimate a sparse vector?
The estimation of a sparse vector in the linear model is a fundamental problem in signal processing, statistics, and compressive sensing. This paper establishes a lower bound on t...
Emmanuel J. Candès, Mark A. Davenport