Sciweavers

28888 search results - page 193 / 5778
» Computability and complexity in analysis
Sort
View
ICPR
2002
IEEE
14 years 9 months ago
A Fast Leading Eigenvector Approximation for Segmentation and Grouping
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
Antonio Robles-Kelly, Sudeep Sarkar, Edwin R. Hanc...
INFSOF
2002
78views more  INFSOF 2002»
13 years 8 months ago
Flow insensitive points-to sets
Pointer analysis is an important part of source code analysis. Many programs that manipulate source code take points-to sets as part of their input. Points-to related data collect...
Paul Anderson, David Binkley, Genevieve Rosay, Tim...
FC
2010
Springer
196views Cryptology» more  FC 2010»
14 years 5 days ago
Modulo Reduction for Paillier Encryptions and Application to Secure Statistical Analysis
Abstract. For the homomorphic Paillier cryptosystem we construct a protocol for secure modulo reduction, that on input of an encryption x with x of bit length x and a public ‘mod...
Jorge Guajardo, Bart Mennink, Berry Schoenmakers
IPPS
2006
IEEE
14 years 2 months ago
Schedulability analysis of non-preemptive recurring real-time tasks
The recurring real-time task model was recently proposed as a model for real-time processes that contain code with conditional branches. In this paper, we present a necessary and ...
Sanjoy K. Baruah, Samarjit Chakraborty
DSN
2009
IEEE
14 years 3 months ago
MAP-AMVA: Approximate mean value analysis of bursty systems
MAP queueing networks are recently proposed models for performance assessment of enterprise systems, such as multi-tier applications, where workloads are significantly affected b...
Giuliano Casale, Evgenia Smirni