Sciweavers

63 search results - page 6 / 13
» How much sweetness is there in the universe
Sort
View
APPROX
2008
Springer
71views Algorithms» more  APPROX 2008»
13 years 9 months ago
Tight Bounds for Hashing Block Sources
It is known that if a 2-universal hash function H is applied to elements of a block source (X1, . . . , XT ), where each item Xi has enough min-entropy conditioned on the previous...
Kai-Min Chung, Salil P. Vadhan
JKM
2007
78views more  JKM 2007»
13 years 7 months ago
A framework for evaluating knowledge-mapping tools
The paper first deals with the much discussed issue of defining the term informatics. Then it explores how the term information science is understood by the students of the Facult...
Samuel Driessen, Willem-Olaf Huijsen, Marjan Groot...
STOC
1991
ACM
84views Algorithms» more  STOC 1991»
13 years 11 months ago
Self-Testing/Correcting for Polynomials and for Approximate Functions
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
Peter Gemmell, Richard J. Lipton, Ronitt Rubinfeld...
CSEE
2009
Springer
14 years 2 months ago
Generic Skills in Software Engineering Master Thesis Projects: Towards Rubric-Based Evaluation
There has been much recent interest in how to help students in higher education develop their generic skills, especially since this is a focus of the Bologna process that aims to ...
Robert Feldt, Martin Höst, Frank Lüders
JUCS
2008
109views more  JUCS 2008»
13 years 7 months ago
Seamless Transition between Connected and Disconnected Collaborative Interaction
Abstract: Nowadays, more and more users make use of web-based collaborative systems. Users participate in communities or search for and provide information in webbased systems. The...
Stephan Lukosch