Sciweavers

436 search results - page 81 / 88
» Multi-Objective Probability Collectives
Sort
View
135
Voted
COLT
2008
Springer
15 years 3 months ago
Almost Tight Upper Bound for Finding Fourier Coefficients of Bounded Pseudo- Boolean Functions
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
Sung-Soon Choi, Kyomin Jung, Jeong Han Kim
86
Voted
HCI
2007
15 years 2 months ago
Cooperation and Competition Dynamics in an Online Game Community
Cooperation and competition are important subjects in social and economical studies. Similar dynamics exists in large-scale online communities. In this paper, we present a quantita...
Ruixi Yuan, Li Zhao, Wenyu Wang
SODA
2004
ACM
111views Algorithms» more  SODA 2004»
15 years 2 months ago
Reconstructing strings from random traces
We are given a collection of m random subsequences (traces) of a string t of length n where each trace is obtained by deleting each bit in the string with probability q. Our goal ...
Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andre...
NIPS
1990
15 years 2 months ago
Bumptrees for Efficient Function, Constraint and Classification Learning
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
Stephen M. Omohundro
UAI
2007
15 years 2 months ago
"I Can Name that Bayesian Network in Two Matrixes!"
The traditional approach to building Bayesian networks is to build the graphical structure using a graphical editor and then add probabilities using a separate spreadsheet for eac...
Russell Almond