Sciweavers

681 search results - page 23 / 137
» General Polynomial Time Decomposition Algorithms
Sort
View
110
Voted
SDM
2010
SIAM
195views Data Mining» more  SDM 2010»
15 years 2 months ago
MACH: Fast Randomized Tensor Decompositions
Tensors naturally model many real world processes which generate multi-aspect data. Such processes appear in many different research disciplines, e.g, chemometrics, computer visio...
Charalampos E. Tsourakakis
WDAG
2007
Springer
125views Algorithms» more  WDAG 2007»
15 years 6 months ago
Approximating Wardrop Equilibria with Finitely Many Agents
We study adaptive routing algorithms in a round-based model. Suppose we are given a network equipped with load-dependent latency functions on the edges and a set of commodities eac...
Simon Fischer, Lars Olbrich, Berthold Vöcking
85
Voted
ACISP
2010
Springer
15 years 2 months ago
Solving Generalized Small Inverse Problems
We introduce a "generalized small inverse problem (GSIP)" and present an algorithm for solving this problem. GSIP is formulated as finding small solutions of f(x0, x1, . ...
Noboru Kunihiro
CP
2006
Springer
15 years 4 months ago
Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs)
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
Robert Mateescu, Rina Dechter
ICGI
2010
Springer
15 years 1 months ago
Generalizing over Several Learning Settings
We recapitulate regular one-shot learning from membership and equivalence queries, positive and negative finite data. We present a meta-algorithm that generalizes over as many sett...
Anna Kasprzik