Sciweavers

895 search results - page 52 / 179
» Using graphs for some discrete tomography problems
Sort
View
TIT
2011
152views more  TIT 2011»
13 years 5 months ago
Fast Exponentiation Using Split Exponents
Abstract—We propose a new method to speed up discrete logarithm (DL)-based cryptosystems by considering a new variant of the DL problem, where the exponents are formed as e1 + α...
Jung Hee Cheon, Stanislaw Jarecki, Taekyoung Kwon,...
IWPC
2002
IEEE
14 years 3 months ago
Slicing Aspect-Oriented Software
Program slicing has many applications in software engineering activities including program comprehension, debugging, testing, maintenance, and model checking. In this paper, we pr...
Jianjun Zhao
ICDE
2003
IEEE
129views Database» more  ICDE 2003»
15 years 9 days ago
Representing Web Graphs
A Web repository is a large special-purpose collection of Web pages and associated indexes. Many useful queries and computations over such repositories involve traversal and navig...
Sriram Raghavan, Hector Garcia-Molina
PPSN
2004
Springer
14 years 4 months ago
An Improved Evaluation Function for the Bandwidth Minimization Problem
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our Î...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
ECCV
2006
Springer
15 years 25 days ago
Robust Multi-body Motion Tracking Using Commute Time Clustering
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...
Huaijun Qiu, Edwin R. Hancock