Sciweavers

4117 search results - page 598 / 824
» On the Satisfiability of Complex Constraints
Sort
View
184
Voted
INTERSENSE
2006
ACM
16 years 20 days ago
Programming wireless sensor networks with logical neighborhoods
— Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified ...
Luca Mottola, Gian Pietro Picco
GLVLSI
2005
IEEE
124views VLSI» more  GLVLSI 2005»
16 years 9 days ago
SOFTENIT: a methodology for boosting the software content of system-on-chip designs
Embedded software is a preferred choice for implementing system functionality in modern System-on-Chip (SoC) designs, due to the high flexibility, and lower engineering costs pro...
Abhishek Mitra, Marcello Lajolo, Kanishka Lahiri
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
16 years 2 days ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
DAWAK
2004
Springer
16 years 2 days ago
Conceptual Design of XML Document Warehouses
EXtensible Markup Language (XML) has emerged as the dominant standard in describing and exchanging data among heterogeneous data sources. XML with its self-describing hierarchical ...
Vicky Nassis, Rajagopal Rajugan, Tharam S. Dillon,...
ISAAC
2003
Springer
141views Algorithms» more  ISAAC 2003»
15 years 12 months ago
Quasi-optimal Arithmetic for Quaternion Polynomials
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
Martin Ziegler