Sciweavers

9405 search results - page 1163 / 1881
» Computing a Model of Set Theory
Sort
View
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 7 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
PLDI
2009
ACM
16 years 2 months ago
A weakest precondition approach to active attacks analysis
Information flow controls can be used to protect both data confidentiality and data integrity. The certification of the security degree of a program that runs in untrusted envi...
Musard Balliu, Isabella Mastroeni
CVPR
2009
IEEE
16 years 1 months ago
Recovering Specular Surfaces Using Curved Line Images
We present a new shape-from-distortion framework for recovering specular (reflective/refractive) surfaces. While most existing approaches rely on accurate correspondences between 2...
Yuanyuan Ding, Jingyi Yu, Peter Sturm
MEMOCODE
2006
IEEE
16 years 1 months ago
Latency-insensitive design and central repetitive scheduling
The theory of latency-insensitive design (LID) was recently invented to cope with the time closure problem in otherwise synchronous circuits and programs. The idea is to allow the...
Julien Boucaron, Robert de Simone, Jean-Vivien Mil...
SIGIR
2006
ACM
16 years 1 months ago
AggregateRank: bringing order to web sites
Since the website is one of the most important organizational structures of the Web, how to effectively rank websites has been essential to many Web applications, such as Web sear...
Guang Feng, Tie-Yan Liu, Ying Wang, Ying Bao, Zhim...
« Prev « First page 1163 / 1881 Last » Next »