Sciweavers

1576 search results - page 65 / 316
» Properties of Synthetic Optimization Problems
Sort
View
SRDS
2000
IEEE
15 years 4 months ago
Optimal Implementation of the Weakest Failure Detector for Solving Consensus
The concept of unreliable failure detector was introduced by Chandra and Toueg [2] as a mechanism that provides information about process failures. Depending on the properties the...
Mikel Larrea, Antonio Fernández, Sergio Ar&...
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
14 years 10 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
MICCAI
2005
Springer
16 years 21 days ago
Cross Entropy: A New Solver for Markov Random Field Modeling and Applications to Medical Image Segmentation
This paper introduces a novel solver, namely cross entropy (CE), into the MRF theory for medical image segmentation. The solver, which is based on the theory of rare event simulati...
Jue Wu, Albert C. S. Chung
ICML
2009
IEEE
15 years 6 months ago
Learning linear dynamical systems without sequence information
Virtually all methods of learning dynamic systems from data start from the same basic assumption: that the learning algorithm will be provided with a sequence, or trajectory, of d...
Tzu-Kuo Huang, Jeff Schneider
ESWA
2008
101views more  ESWA 2008»
14 years 12 months ago
Discovering during-temporal patterns (DTPs) in large temporal databases
Abstract Large temporal Databases (TDBs) usually contain a wealth of data about temporal events. Aimed at discovering temporal patterns with during relationship (during-temporal pa...
Li Zhang, Guoqing Chen, Tom Brijs, Xing Zhang