Sciweavers

10271 search results - page 617 / 2055
» Computer Science
Sort
View
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
15 years 10 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
MKWI
2008
156views Business» more  MKWI 2008»
15 years 8 months ago
Enabling Open Innovation in a World of Ubiquitous Computing - Proposing a Research Agenda
: This article proposes a new Ubiquitous Computing (UC) infrastructure for open access to object data that will come along with a new research agenda especially for the field of Wi...
Detlef Schoder, Christian Schmitt, Kai Fischbach, ...
DATAMINE
2006
127views more  DATAMINE 2006»
15 years 7 months ago
Computing LTS Regression for Large Data Sets
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
Peter Rousseeuw, Katrien van Driessen
SCP
1998
163views more  SCP 1998»
15 years 7 months ago
Computing with Continuous Change
A central challenge in computer science and knowledge representation is the integration of conceptual frameworks for continuous and discrete change, as exemplified by the theory ...
Vineet Gupta, Radha Jagadeesan, Vijay A. Saraswat
TPDS
2010
185views more  TPDS 2010»
15 years 5 months ago
All-Pairs: An Abstraction for Data-Intensive Computing on Campus Grids
s: An Abstraction for Data Intensive Computing on Campus Grids Christopher Moretti, Hoang Bui, Karen Hollingsworth, Brandon Rich, Patrick Flynn, and Douglas Thain Department of Com...
Christopher Moretti, Hoang Bui, Karen Hollingswort...