Sciweavers

8695 search results - page 216 / 1739
» Making the Complex Simple
Sort
View
IPPS
2007
IEEE
16 years 27 days ago
A Survey of Worst-Case Execution Time Analysis for Real-Time Java
As real-time systems become more prevalent, there is a need to guarantee that these increasingly complex systems perform as designed. One technique involves a static analysis to p...
Trevor Harmon, Raymond Klefstad
SP
2007
IEEE
120views Security Privacy» more  SP 2007»
16 years 26 days ago
Endorsed E-Cash
An electronic cash (e-cash) scheme lets a user withdraw money from a bank and then spend it anonymously. E-cash can be used only if it can be securely and fairly exchanged for ele...
Jan Camenisch, Anna Lysyanskaya, Mira Meyerovich
COCO
2007
Springer
114views Algorithms» more  COCO 2007»
16 years 23 days ago
Directed Planar Reachability is in Unambiguous Log-Space
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
Chris Bourke, Raghunath Tewari, N. V. Vinodchandra...
COLT
2007
Springer
16 years 23 days ago
Multi-view Regression Via Canonical Correlation Analysis
In the multi-view regression problem, we have a regression problem where the input variable (which is a real vector) can be partitioned into two different views, where it is assum...
Sham M. Kakade, Dean P. Foster
CSCLP
2007
Springer
16 years 23 days ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth