14704 search results - page 242 / 2941 » computing 2007 |
ISCAS
2007
IEEE
15 years 10 months ago
2007
IEEE
— Sphere decoding enables maximum likelihood (ML) detection with lower complexity than other decoding algorithms, but it still suffers from large computational delay. This paper ...
109
Voted
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
— We propose Computational Sensor Networks as a methodology to exploit models of physical phenomena in order to better understand the structure of the sensor network. To do so, i...
113
Voted
ISSAC
2007
Springer
15 years 9 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
114
Voted
CRYPTO
2007
Springer
15 years 7 months ago
2007
Springer
Oblivious transfer (OT) is an essential building block for secure multiparty computation when there is no honest majority. In this setting, current protocols for n 3 parties requ...
92
Voted
SAINT
2007
IEEE
15 years 10 months ago
2007
IEEE
We present a user profile management component for ubiquitous computing environments that provides management, inquiry and delivery of context-dependent user preferences. In part...