Sciweavers

4539 search results - page 126 / 908
» Approaches to Compute Workflow Complexity
Sort
View
CORR
2002
Springer
159views Education» more  CORR 2002»
14 years 9 months ago
Complexity of Mechanism Design
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism de...
Vincent Conitzer, Tuomas Sandholm
TSP
2010
14 years 4 months ago
A low complexity blind estimator of narrowband polynomial phase signals
Consider the problem of estimating the parameters of multiple polynomial phase signals observed by a sensor array. In practice, it is difficult to maintain a precisely calibrated a...
Alon Amar, Amir Leshem, Alle-Jan van der Veen
EVOW
2008
Springer
14 years 11 months ago
Divide, Align and Full-Search for Discovering Conserved Protein Complexes
Advances in modern technologies for measuring protein-protein interaction (PPI) has boosted research in PPI networks analysis and comparison. One of the challenging problems in com...
Pavol Jancura, Jaap Heringa, Elena Marchiori
IDA
2009
Springer
15 years 2 months ago
Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework
Searching for interesting patterns in binary matrices plays an important role in data mining and, in particular, in formal concept analysis and related disciplines. Several algorit...
Petr Krajca, Vilém Vychodil
ICIP
2000
IEEE
15 years 11 months ago
Computationally Scalable Partial Distance Based Fast Search Motion Estimation
In this paper, we present a class of algorithms that use a partial distance metric to speedup the motion estimation process. The partial distance metric is used within the motion ...
Krisda Lengwehasatit, Antonio Ortega