Sciweavers

6274 search results - page 665 / 1255
» From query complexity to computational complexity
Sort
View
ICASSP
2009
IEEE
16 years 2 months ago
A differential geometric approach to discrete-coefficient filter design
This paper is concerned with the problem of computing a discretecoefficient approximation to a digital filter. In contrast to earlier works that have approached this problem usi...
Subramanian Ramamoorthy, Lothar Wenzel, James Nagl...
185
Voted
ICPPW
2009
IEEE
16 years 1 months ago
Towards a Component-Based Observation of MPSoC
Abstract——Motivated by the increasing heterogeneity and complexity of MPSoC systems, we propose a component-based generic approach for MPSoC observation. We show that components...
Carlos Prada-Rojas, Vania Marangozova-Martin, Kiri...
ACG
2009
Springer
16 years 1 months ago
Solving Kriegspiel Endings with Brute Force: The Case of KR vs. K
Retrograde analysis is a tool for reconstructing a game tree starting from its leaves; with these techniques one can solve specific subsets of a complex game, achieving optimal pl...
Paolo Ciancarini, Gian Piero Favini
ACG
2009
Springer
16 years 1 months ago
Automated Discovery of Search-Extension Features
One of the main challenges with selective search extensions is designing effective move categories (features). This is a manual trial and error task, which requires both intuition...
Pálmi Skowronski, Yngvi Björnsson, Mar...
212
Voted
BPM
2009
Springer
138views Business» more  BPM 2009»
16 years 1 months ago
Graph Matching Algorithms for Business Process Model Similarity Search
We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the applicat...
Remco M. Dijkman, Marlon Dumas, Luciano Garc&iacut...