1350 search results - page 230 / 270 » Reasoning about Staged Computation |
DCC
2007
IEEE
15 years 9 months ago
2007
IEEE
We consider video sequences that have been encrypted uncompressed. Since encryption masks the source, traditional data compression algorithms are rendered ineffective. However, it...
SPAA
2009
ACM
15 years 7 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
COCO
2004
Springer
15 years 3 months ago
2004
Springer
We study several properties of sets that are complete for NP. We prove that if L is an NP-complete set and S ⊇ L is a p-selective sparse set, then L − S is ≤p m-hard for NP....
CHI
2009
ACM
15 years 1 months ago
2009
ACM
We conducted a field-based study examining informal nursing information. We examined the use of this information before and after the adoption of a CPOE (Computerized Provider Ord...
GI
2009
Springer
14 years 7 months ago
2009
Springer
: We explore the expressiveness of the BPMN workflow modelling language by applying it to MuCoMS, a paper submission system. This well known application domain is a suitable exampl...