Sciweavers

1347 search results - page 65 / 270
» On the Structure of the Minimum Time Function
Sort
View
CCCG
2008
13 years 10 months ago
Core-Preserving Algorithms
We define a class of algorithms for constructing coresets of (geometric) data sets, and show that algorithms in this class can be dynamized efficiently in the insertiononly (data ...
Hamid Zarrabi-Zadeh
TSP
2008
180views more  TSP 2008»
13 years 9 months ago
A Square-Root Nyquist (M) Filter Design for Digital Communication Systems
Designing matched transmit and receive filters such that their combination satisfies the Nyquist condition is a classical problem in digital communication systems. In this paper, ...
Behrouz Farhang-Boroujeny
FSE
2006
Springer
159views Cryptology» more  FSE 2006»
14 years 21 days ago
Breaking the ICE - Finding Multicollisions in Iterated Concatenated and Expanded (ICE) Hash Functions
The security of hash functions has recently become one of the hottest topics in the design and analysis of cryptographic primitives. Since almost all the hash functions used today ...
Jonathan J. Hoch, Adi Shamir
ICIC
2009
Springer
14 years 3 months ago
Function Sequence Genetic Programming
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
Shixian Wang, Yuehui Chen, Peng Wu
ASAP
2010
IEEE
148views Hardware» more  ASAP 2010»
13 years 10 months ago
Function flattening for lease-based, information-leak-free systems
Recent research has proposed security-critical real-time embedded systems with provably-strong information containment through the use of hardware-enforced execution leases. Execut...
Xun Li, Mohit Tiwari, Timothy Sherwood, Frederic T...