Sciweavers

920 search results - page 42 / 184
» Computing the Frequency of Partial Orders
Sort
View
AAAI
2012
11 years 10 months ago
Competing with Humans at Fantasy Football: Team Formation in Large Partially-Observable Domains
We present the first real-world benchmark for sequentiallyoptimal team formation, working within the framework of a class of online football prediction games known as Fantasy Foo...
Tim Matthews, Sarvapali D. Ramchurn, Georgios Chal...
DATE
2004
IEEE
108views Hardware» more  DATE 2004»
13 years 11 months ago
Poor Man's TBR: A Simple Model Reduction Scheme
This paper presents a model reduction algorithm motivated by a connection between frequency domain projection methods and approximation of truncated balanced realizations. The met...
Joel R. Phillips, Luis Miguel Silveira
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
14 years 8 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
MLG
2007
Springer
14 years 1 months ago
Support Computation for Mining Frequent Subgraphs in a Single Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt
BIRD
2008
Springer
141views Bioinformatics» more  BIRD 2008»
13 years 9 months ago
Nested q-Partial Graphs for Genetic Network Inference from "Small n, Large p" Microarray Data
Abstract. Gaussian graphical models are widely used to tackle the important and challenging problem of inferring genetic regulatory networks from expression data. These models have...
Kevin Kontos, Gianluca Bontempi