Sciweavers

19320 search results - page 318 / 3864
» On the complexity of computing determinants
Sort
View
CISS
2008
IEEE
16 years 1 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie
CISST
2003
83views Hardware» more  CISST 2003»
15 years 8 months ago
Computational Efficiency of Structural Image Matching
This paper addresses computational efficiency issues of a new algebraic method for imagery registration/conflation. An algebraic approach to conflation/registration of images does ...
Richard Chase, Boris Kovalerchuk
COMPLEXITY
2006
144views more  COMPLEXITY 2006»
15 years 6 months ago
BML revisited: Statistical physics, computer simulation, and probability
Statistical physics, computer simulation and discrete mathematics are intimately related through the study of shared lattice models. These models lie at the foundation of all thre...
Raissa M. D'Souza
ATAL
2007
Springer
16 years 27 days ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
16 years 25 days ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...