Sciweavers

2778 search results - page 20 / 556
» Limit complexities revisited
Sort
View
SACRYPT
2009
Springer
150views Cryptology» more  SACRYPT 2009»
15 years 4 months ago
Information Theoretically Secure Multi Party Set Intersection Re-visited
We re-visit the problem of secure multiparty set intersection in information theoretic settings. In [16], Li et.al have proposed a protocol for multiparty set intersection problem...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
CSR
2007
Springer
15 years 4 months ago
On the Complexity of Matrix Rank and Rigidity
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
Meena Mahajan, Jayalal M. N. Sarma
CGO
2007
IEEE
15 years 4 months ago
On the Complexity of Register Coalescing
Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which ...
Florent Bouchez, Alain Darte, Fabrice Rastello
CORR
2006
Springer
87views Education» more  CORR 2006»
14 years 9 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
ICRA
2006
IEEE
137views Robotics» more  ICRA 2006»
15 years 3 months ago
Using Multi-hypothesis Mapping to close Loops in Complex Cyclic Environments
— This paper describes an off-line, iterative algorithm for simultaneous localization and mapping within large indoor environments. The proposed approach is based on the idea of ...
Haris Baltzakis, Panos E. Trahanias