Sciweavers

6274 search results - page 303 / 1255
» From query complexity to computational complexity
Sort
View
EVOW
2010
Springer
15 years 11 months ago
Evolutionary Sound Synthesis: Rendering Spectrograms from Cellular Automata Histograms
In this paper we report on the synthesis of sounds using cellular automata, specifically the multitype voter model. The mapping process adopted is based on digital signal processin...
Jaime Serquera, Eduardo R. Miranda
BPM
2008
Springer
136views Business» more  BPM 2008»
15 years 8 months ago
From Paper Based Clinical Practice Guidelines to Declarative Workflow Management
We present a field study of oncology workflow, involving doctors, nurses and pharmacists at Danish hospitals and discuss the obstacles, enablers and challenges for the use of compu...
Karen Marie Lyng, Thomas Hildebrandt, Raghava Rao ...
CORR
2010
Springer
67views Education» more  CORR 2010»
15 years 6 months ago
From granular avalanches to fluid turbulences through oozing pastes. A mesoscopic physically-based particle model
In this paper, we describe how we can precisely produce complex and various dynamic morphological features such as structured and chaotic features which occur in sand pilings (pil...
Annie Luciani
ASE
2004
137views more  ASE 2004»
15 years 6 months ago
Automatically Restructuring Programs for the Web
The construction of interactive server-side Web applications differs substantially from the construction of traditional interactive programs. In contrast, existing Web programming...
Jacob Matthews, Robert Bruce Findler, Paul T. Grau...
STOC
2002
ACM
107views Algorithms» more  STOC 2002»
16 years 6 months ago
Quantum lower bound for the collision problem
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
Scott Aaronson