Sciweavers

29908 search results - page 426 / 5982
» On the Complexity of
Sort
View
PG
2002
IEEE
15 years 12 months ago
Roadmap-Based Flocking for Complex Environments
Flocking behavior is very common in nature, and there have been ongoing research efforts to simulate such behavior in computer animations and robotics applications. Generally, suc...
O. Burçhan Bayazit, Jyh-Ming Lien, Nancy M....
ICISP
2010
Springer
15 years 11 months ago
Classification of High-Resolution NMR Spectra Based on Complex Wavelet Domain Feature Selection and Kernel-Induced Random Forest
High-resolution nuclear magnetic resonance (NMR) spectra contain important biomarkers that have potentials for early diagnosis of disease and subsequent monitoring of its progressi...
Guangzhe Fan, Zhou Wang, Seoung Bum Kim, Chivalai ...
FM
2009
Springer
95views Formal Methods» more  FM 2009»
15 years 11 months ago
On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery
The problem of enforcing bounded-time 2-phase recovery in real-time programs is often necessitated by conflict between faulttolerance requirements and timing constraints. In this ...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
SIGGRAPH
2010
ACM
15 years 11 months ago
Precomputed wave simulation for real-time sound propagation of dynamic sources in complex scenes
We present a method for real-time sound propagation that captures all wave effects, including diffraction and reverberation, for multiple moving sources and a moving listener in a...
Nikunj Raghuvanshi, John Snyder, Ravish Mehra, Min...
WG
2001
Springer
15 years 11 months ago
Graph Subcolorings: Complexity and Algorithms
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
Jirí Fiala, Klaus Jansen, Van Bang Le, Eike...