4277 search results - page 312 / 856 » On Multiple Linear Approximations |
TARK
2007
Springer
15 years 5 months ago
2007
Springer
This paper generalizes the notion of common p-beliefs to situations of ambiguity or Knightian uncertainty. When players have multiple prior beliefs,we show that Aumann’s no-agre...
118
click to vote
MOBIHOC
2002
ACM
15 years 11 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
LATIN
2010
Springer
14 years 9 months ago
2010
Springer
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
113
click to vote
ICMCS
2009
IEEE
14 years 9 months ago
2009
IEEE
Time series pattern mining (TSPM) finds correlations or dependencies in same series or in multiple time series. When the numerous instances of multiple time series data are associ...
101
click to vote
BMCBI
2006
14 years 11 months ago
2006
Background: Multiple sequence alignment is the foundation of many important applications in bioinformatics that aim at detecting functionally important regions, predicting protein...