Sciweavers

4940 search results - page 814 / 988
» On the Complexity of Universal Programs
Sort
View
170
Voted
INFOCOM
2006
IEEE
16 years 1 months ago
Trade-Off Curves for QoS Routing
— Trade-off curves for the exact and the relaxed QoS routing problem are presented and discussed. In addition, an efficient parametric linear programming algorithm to compute th...
Piet Van Mieghem, Lieven Vandenberghe
149
Voted
IPPS
2006
IEEE
16 years 1 months ago
Tree-based overlay networks for scalable applications
The increasing availability of high-performance computing systems with thousands, tens of thousands, and even hundreds of thousands of computational nodes is driving the demand fo...
Dorian C. Arnold, G. D. Pack, Barton P. Miller
193
Voted
IPPS
2006
IEEE
16 years 1 months ago
Automatic application-specific microarchitecture reconfiguration
Applications for constrained embedded systems are subject to strict time constraints and restrictive resource utilization. With soft core processors, application developers can cu...
Shobana Padmanabhan, Ron K. Cytron, Roger D. Chamb...
166
Voted
IRI
2006
IEEE
16 years 1 months ago
A similarity based technique for detecting malicious executable files for computer forensics
With the rapidly increasing complexity of computer systems and the sophistication of hacking tools and techniques, there is a crucial need for computer forensic analysis technique...
Jun-Hyung Park, Minsoo Kim, BongNam Noh, James B. ...
ISCAS
2006
IEEE
112views Hardware» more  ISCAS 2006»
16 years 1 months ago
Towards an optimised VLSI design algorithm for the constant matrix multiplication problem
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor