1084 search results - page 101 / 217 » Optimal worm-scanning method using vulnerable-host distribut... |
249
click to vote
PAMI
2012
13 years 9 months ago
2012
—We propose a probabilistic formulation of joint silhouette extraction and 3D reconstruction given a series of calibrated 2D images. Instead of segmenting each image separately i...
221
click to vote
TIP
2011
15 years 1 months ago
2011
—One of the major challenges in multi-view imaging is the definition of a representation that reveals the intrinsic geometry of the visual information. Sparse image representati...
190
click to vote
STOC
2009
ACM
16 years 7 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...
239
click to vote
DIALM
2007
ACM
15 years 10 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
166
click to vote
ICS
2003
Tsinghua U.
16 years 2 days ago
2003
Tsinghua U.
Cache behavior modeling is an important part of modern optimizing compilers. In this paper we present a method to estimate the number of cache misses, at compile time, using a mac...