Sciweavers

6274 search results - page 366 / 1255
» From query complexity to computational complexity
Sort
View
JMLR
2008
148views more  JMLR 2008»
15 years 6 months ago
Linear-Time Computation of Similarity Measures for Sequential Data
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...
Konrad Rieck, Pavel Laskov
ISVC
2010
Springer
15 years 5 months ago
Computer-Generated Tie-Dyeing Using a 3D Diffusion Graph
Abstract. Hand dyeing generates artistic representations with unique and complex patterns. The aesthetics of dyed patterns on a cloth originate from the physical properties of dyei...
Yuki Morimoto, Kenji Ono
224
Voted
MODELS
2007
Springer
16 years 27 days ago
Model-Based Design of Computer-Controlled Game Character Behavior
Recently, the complexity of modern, real-time computer games has increased drastically. The need for sophisticated game AI, in particular for Non-Player Characters, grows with the ...
Jörg Kienzle, Alexandre Denault, Hans Vanghel...
FCCM
2000
IEEE
105views VLSI» more  FCCM 2000»
15 years 11 months ago
Configuration Relocation and Defragmentation for Reconfigurable Computing
Custom computing systems exhibit significant speedups over traditional microprocessors by mapping compute-intensive sections of a program to reconfigurable logic [Hauck98]. Howeve...
Katherine Compton, James Cooley, Stephen Knol, Sco...
CORR
1999
Springer
65views Education» more  CORR 1999»
15 years 6 months ago
Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets
It is known that for any class C closed under union and intersection, the Boolean closure of C, the Boolean hierarchy over C, and the symmetric difference hierarchy over C all are ...
Lane A. Hemaspaandra, Jörg Rothe