Sciweavers

5606 search results - page 414 / 1122
» Randomization Techniques for Graphs.
Sort
View
INFOCOM
2000
IEEE
15 years 11 months ago
Blocking in All-Optical Networks
— We present a new analytical technique, based on the inclusion–exclusion principle from combinatorics, for the analysis of all-optical networks with no wavelength conversion a...
Ashwin Sridharan, Kumar N. Sivarajan
APLAS
2010
ACM
15 years 7 months ago
Automatically Inferring Quantified Loop Invariants by Algorithmic Learning from Simple Templates
Abstract. By combining algorithmic learning, decision procedures, predicate abstraction, and simple templates, we present an automated technique for finding quantified loop invaria...
Soonho Kong, Yungbum Jung, Cristina David, Bow-Yaw...
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 6 months ago
JIT Spraying and Mitigations
With the discovery of new exploit techniques, novel protection mechanisms are needed as well. Mitigations like DEP (Data Execution Prevention) or ASLR (Address Space Layout Random...
Piotr Bania
208
Voted
CVPR
2007
IEEE
16 years 8 months ago
A Graph Cut Approach to Image Segmentation in Tensor Space
This paper proposes a novel method to apply the standard graph cut technique to segmenting multimodal tensor valued images. The Riemannian nature of the tensor space is explicitly...
Allen Tannenbaum, James G. Malcolm, Yogesh Rathi
ICCV
2007
IEEE
16 years 8 months ago
Graph Based Discriminative Learning for Robust and Efficient Object Tracking
Object tracking is viewed as a two-class 'one-versusrest' classification problem, in which the sample distribution of the target is approximately Gaussian while the back...
Xiaoqin Zhang, Weiming Hu, Stephen J. Maybank, Xi ...