Sciweavers

4714 search results - page 9 / 943
» The Complexity of Iterated Multiplication
Sort
View
PAKDD
2001
ACM
104views Data Mining» more  PAKDD 2001»
14 years 2 months ago
Optimizing the Induction of Alternating Decision Trees
The alternating decision tree brings comprehensibility to the performance enhancing capabilities of boosting. A single interpretable tree is induced wherein knowledge is distribute...
Bernhard Pfahringer, Geoffrey Holmes, Richard Kirk...
EVOW
2008
Springer
13 years 11 months ago
Divide, Align and Full-Search for Discovering Conserved Protein Complexes
Advances in modern technologies for measuring protein-protein interaction (PPI) has boosted research in PPI networks analysis and comparison. One of the challenging problems in com...
Pavol Jancura, Jaap Heringa, Elena Marchiori
ICML
2004
IEEE
14 years 10 months ago
Communication complexity as a lower bound for learning in games
A fast-growing body of research in the AI and machine learning communities addresses learning in games, where there are multiple learners with different interests. This research a...
Vincent Conitzer, Tuomas Sandholm
WSCG
2001
66views more  WSCG 2001»
13 years 11 months ago
Supporting the Search for the Optimal Location of Facilities
the problem of locating services in a given context requires a methematical abstraction so that its complexity can be managed by means of an iterative search through context simul...
Alberto Biancardi, R. De Lotto, Elena Ferrari
DAGSTUHL
2007
13 years 11 months ago
Measuring Ranks via the Complete Laws of Iterated Contraction
: Ranking theory delivers an account of iterated contraction; each ranking function induces a specific iterated contraction behavior. The paper gives a complete axiomatization of t...
Wolfgang Spohn