Sciweavers

4940 search results - page 817 / 988
» On the Complexity of Universal Programs
Sort
View
CIMCA
2005
IEEE
16 years 1 days ago
Applying a Web-Service-Based Model to Dynamic Service-Deployment
Owing to the increase in both heterogeneity and complexity in today’s networking systems, the need arises for an architecture for network-based services that provides flexibilit...
Christos Chrysoulas, Evangelos Haleplidis, Robert ...
FOCS
2005
IEEE
16 years 21 hour ago
On the Impossibility of Obfuscation with Auxiliary Input
Barak et al. formalized the notion of obfuscation, and showed that there exist (contrived) classes of functions that cannot be obfuscated. In contrast, Canetti and Wee showed how ...
Shafi Goldwasser, Yael Tauman Kalai
ICAC
2005
IEEE
16 years 18 hour ago
Myrrh: A Transaction-Based Model for Autonomic Recovery
As software comes under increasing scrutiny for its lack of safety and reliability, numerous static and partially dynamic tools (including model checking) have been proposed for v...
Guy Eddon, Steven P. Reiss
ICMCS
2005
IEEE
119views Multimedia» more  ICMCS 2005»
16 years 9 hour ago
Evaluation of the Interleaved Source Coding (ISC) Under Packet Correlation
Network impairments such as delay and packet losses have severe impact on the presentation quality of many predictive video sources. Prior researches (e.g., [1]-[3][5]-[9][11]-[13...
Jin Young Lee, Hayder Radha
ICPPW
2005
IEEE
16 years 7 hour ago
Factoring Solution Sets of Polynomial Systems in Parallel
We report on a £rst parallel implementation of a recent algorithm to factor positive dimensional solution sets of polynomial systems. As the algorithm uses homotopy continuation,...
Anton Leykin, Jan Verschelde