8695 search results - page 24 / 1739 » Making the Complex Simple |
SAC
2005
ACM
14 years 1 months ago
2005
ACM
Complex application-specific media instructions and kernels are emulated with simple to implement extended subword instructions. We show that assuming extended register file ent...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
POPL
2008
ACM
14 years 8 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
GLOBECOM
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— For many evolving application scenarios like ubiquitous and autonomic computing systems, trustworthy computing solutions are essential. However the fact that the autono...
FUIN
2008
13 years 8 months ago
2008
Abstract. Many formalisms use interleaving to model concurrency. To describe some system behaviours appropriately, we need to limit interleaving. For example, in a component-based ...