Sciweavers

680 search results - page 18 / 136
» Computational Complexity and Anytime Algorithm for Inconsist...
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Fast algorithms for Iterative Adaptive Approach spectral estimation techniques
This paper presents computationally efficient implementations for Iterative Adaptive Approach (IAA) spectral estimation techniques for uniformly sampled data sets. By exploiting ...
George-Othon Glentis, Andreas Jakobsson
MAAMAW
1993
Springer
13 years 12 months ago
Coalition Formation Among Autonomous Agents
Autonomous agents working in multi-agent environments may need to cooperate in order to ful ll tasks. Given a set of agents and a set of tasks which they have to satisfy, we consi...
Steven P. Ketchpel
GD
1998
Springer
14 years 17 hour ago
A Framework for Drawing Planar Graphs with Curves and Polylines
We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties...
Michael T. Goodrich, Christopher G. Wagner
GI
2009
Springer
13 years 5 months ago
A Static Analysis Technique to Detect Unsatisfiable Conditions in Ontology-based Workflows
: Static analysis techniques for consistency checking of workflows allow to avoid runtime errors. This is in particular crucial for long running workflows where errors, detected la...
Gabriele Weiler, Arnd Poetzsch-Heffter, Stephan Ki...
TALG
2010
158views more  TALG 2010»
13 years 2 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...