Sciweavers

2723 search results - page 22 / 545
» Learning lexicographic orders
Sort
View
ICDM
2002
IEEE
93views Data Mining» more  ICDM 2002»
14 years 10 days ago
Learning from Order Examples
We advocate a new learning task that deals with orders of items, and we call this the Learning from Order Examples (LOE) task. The aim of the task is to acquire the rule that is u...
Toshihiro Kamishima, Shotaro Akaho
ECSQARU
2001
Springer
13 years 12 months ago
The Search of Causal Orderings: A Short Cut for Learning Belief Networks
Abstract. Although we can build a belief network starting from any ordering of its variables, its structure depends heavily on the ordering being selected: the topology of the netw...
Silvia Acid, Luis M. de Campos, Juan F. Huete
CASC
2007
Springer
112views Mathematics» more  CASC 2007»
14 years 1 months ago
Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors
A common way of implementing multivariate polynomial multiplication and division is to represent polynomials as linked lists of terms sorted in a term ordering and to use repeated ...
Michael B. Monagan, Roman Pearce
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
13 years 10 months ago
O(1)-Time Unsorting by Prefix-Reversals in a Boustrophedon Linked List
Conventional wisdom suggests that O(k)-time is required to reverse a substring of length k. To reduce this time complexity, a simple and unorthodox data structure is introduced. A ...
Aaron Williams
IPCO
2010
231views Optimization» more  IPCO 2010»
13 years 8 months ago
Branched Polyhedral Systems
We introduce the framework of polyhedral branching systems that can be used in order to construct extended formulations for polyhedra by combining extended formulations for other p...
Volker Kaibel, Andreas Loos