Sciweavers

9260 search results - page 1676 / 1852
» Posterior distributions are computable from predictive distr...
Sort
View
COMPUTE
2010
ACM
15 years 11 months ago
Mining periodic-frequent patterns with maximum items' support constraints
The single minimum support (minsup) based frequent pattern mining approaches like Apriori and FP-growth suffer from“rare item problem”while extracting frequent patterns. That...
R. Uday Kiran, P. Krishna Reddy
PARA
1995
Springer
15 years 10 months ago
ScaLAPACK Tutorial
Abstract. ScaLAPACK is a library of high performance linear algebra routines for distributed memory MIMD computers. It is a continuation of the LAPACK project, which designed and p...
Jack Dongarra, Antoine Petitet
DAGSTUHL
2006
15 years 8 months ago
Cognitive Vision Needs Attention to Link Sensing with Recognition
Abstract. "Cognitive computer vision is concerned with integration and control of vision systems using explicit but not necessarily symbolic models of context, situation and g...
John K. Tsotsos
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
15 years 6 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
CORR
2010
Springer
116views Education» more  CORR 2010»
15 years 6 months ago
Where are the hard manipulation problems?
One possible escape from the Gibbard-Satterthwaite theorem is computational complexity. For example, it is NP-hard to compute if the STV rule can be manipulated. However, there is...
Toby Walsh
« Prev « First page 1676 / 1852 Last » Next »