Sciweavers

1279 search results - page 221 / 256
» Approximation Algorithms for Min-Max Generalization Problems
Sort
View
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 8 months ago
Fast discovery of unexpected patterns in data, relative to a Bayesian network
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
Szymon Jaroszewicz, Tobias Scheffer
INFOCOM
2003
IEEE
14 years 27 days ago
Improving Web Performance in Broadcast-Unicast Networks
— Satellite operators have recently begun offering Internet access over their networks. Typically, users connect to the network using a modem for uplink, and a satellite dish for...
Mukesh Agrawal, Amit Manjhi, Nikhil Bansal, Sriniv...
AAAI
2007
13 years 10 months ago
Thresholded Rewards: Acting Optimally in Timed, Zero-Sum Games
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...
Colin McMillen, Manuela M. Veloso
COLING
1996
13 years 9 months ago
Learning Dependencies between Case Frame Slots
We address the problem of automatically acquiring case frame patterns (selectional patterns) from large corpus data. In particular, we l)ropose a method of learning dependencies b...
Hang Li, Naoki Abe
GECCO
2008
Springer
192views Optimization» more  GECCO 2008»
13 years 8 months ago
Non-linear factor model for asset selection using multi objective genetic programming
Investors vary with respect to their expected return and aversion to associated risk, and hence also vary in their performance expectations of the stock market portfolios they hol...
Ghada Hassan