Sciweavers

1686 search results - page 238 / 338
» Programs as polygraphs: computability and complexity
Sort
View
129
Voted
ICC
2008
IEEE
134views Communications» more  ICC 2008»
15 years 10 months ago
Secret Little Functions and Codebook for Protecting Users from Password Theft
—In this paper, we discuss how to prevent users’ passwords from being stolen by adversaries. We propose differentiated security mechanisms in which a user has the freedom to ch...
Yang Xiao, Chung-Chih Li, Ming Lei, Susan V. Vrbsk...
ISORC
2008
IEEE
15 years 10 months ago
A Real-Time Java Component Model
The Real-Time Specification for Java (RTSJ) [10] is becoming a popular choice in the world of real-time programming. However, the complexities introduced by RTSJ bring the needs ...
Ales Plsek, Philippe Merle, Lionel Seinturier
APCSAC
2007
IEEE
15 years 10 months ago
Implicit Transactional Memory in Kilo-Instruction Multiprocessors
Although they have been the main server technology for many years, multiprocessors are undergoing a renaissance due to multi-core chips and the attractive scalability properties of...
Marco Galluzzi, Enrique Vallejo, Adrián Cri...
112
Voted
SBACPAD
2005
IEEE
139views Hardware» more  SBACPAD 2005»
15 years 9 months ago
Chained In-Order/Out-of-Order DoubleCore Architecture
Complexity is one of the most important problems facing microarchitects. It is exacerbated by the application of optimizations, by scaling to higher issue widths and, in general, ...
Miquel Pericàs, Adrián Cristal, Rube...
MFCS
2005
Springer
15 years 9 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher