5220 search results - page 136 / 1044 » Changing Persistent Applications |
133
click to vote
JCO
2006
15 years 4 months ago
2006
A k-decomposition of a tree is a process in which the tree is recursively partitioned into k edge-disjoint subtrees until each subtree contains only one edge. We investigated the p...
107
click to vote
ICASSP
2011
IEEE
14 years 8 months ago
2011
IEEE
All of the existing N-point discrete fractional signal transforms require O(N2 ) computation complexity. In this paper, we propose a new discrete fractional signal transform whose...
120
click to vote
WWW
2004
ACM
16 years 5 months ago
2004
ACM
A fundamental task on the Grid is to decide what jobs to run on what computing resources based on job or application requirements. Our previous work on ontology-based matchmaking ...
126
click to vote
SOSP
2009
ACM
16 years 1 months ago
2009
ACM
We describe Neutron, a version of the TinyOS operating system that efficiently recovers from memory safety bugs. Where existing schemes reboot an entire node on an error, Neutron...
130
click to vote
ACSAC
2005
IEEE
15 years 10 months ago
2005
IEEE
Malware such as Trojan Horses and spyware remain to be persistent security threats that exploit the overly complex graphical user interfaces of today’s commodity operating syste...