Sciweavers

512 search results - page 98 / 103
» Anticipating the Digital University
Sort
View
AI
2010
Springer
14 years 12 months ago
Optimal query complexity bounds for finding graphs
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
Sung-Soon Choi, Jeong Han Kim
COMPUTER
2006
92views more  COMPUTER 2006»
14 years 11 months ago
The Moment Camera
more abstract realms of Impressionism, and more pure Abstraction. The camera, although capable of capturing instants in time, cannot on its own--except in rare instances--truly rec...
Michael F. Cohen, Richard Szeliski
JUCS
2008
156views more  JUCS 2008»
14 years 11 months ago
Efficient k-out-of-n Oblivious Transfer Schemes
Abstract: Oblivious transfer is an important cryptographic protocol in various security applications. For example, in on-line transactions, a k-out-of-n oblivious transfer scheme a...
Cheng-Kang Chu, Wen-Guey Tzeng
ECCC
2007
115views more  ECCC 2007»
14 years 11 months ago
A (De)constructive Approach to Program Checking
Program checking, program self-correcting and program selftesting were pioneered by [Blum and Kannan] and [Blum, Luby and Rubinfeld] in the mid eighties as a new way to gain conï¬...
Shafi Goldwasser, Dan Gutfreund, Alexander Healy, ...
SIGMETRICS
2008
ACM
115views Hardware» more  SIGMETRICS 2008»
14 years 11 months ago
Densification arising from sampling fixed graphs
During the past decade, a number of different studies have identified several peculiar properties of networks that arise from a diverse universe, ranging from social to computer n...
Pedram Pedarsani, Daniel R. Figueiredo, Matthias G...