Sciweavers

1258 search results - page 94 / 252
» Architecture-driven Problem Decomposition
Sort
View
ICALP
2010
Springer
14 years 1 months ago
Dynamic Programming for Graphs on Surfaces
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
Juanjo Rué, Ignasi Sau, Dimitrios M. Thilik...
JMLR
2006
105views more  JMLR 2006»
13 years 9 months ago
Parallel Software for Training Large Scale Support Vector Machines on Multiprocessor Systems
Parallel software for solving the quadratic program arising in training support vector machines for classification problems is introduced. The software implements an iterative dec...
Luca Zanni, Thomas Serafini, Gaetano Zanghirati
TSP
2008
118views more  TSP 2008»
13 years 8 months ago
A Block Component Model-Based Blind DS-CDMA Receiver
In this paper, we consider the problem of blind multiuser separation-equalization in the uplink of a wideband DS-CDMA system, in a multipath propagation environment with intersymbo...
Dimitri Nion, Lieven De Lathauwer
AAAI
2011
12 years 9 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
DKE
2002
113views more  DKE 2002»
13 years 9 months ago
A general strategy for decomposing topological invariants of spatial databases and an application
Topological invariants of spatial databases (i.e., finite structures that capture the topological properties of the database) are receiving increasing attention since they can act...
Serafino Cicerone, Daniele Frigioni, Paolino Di Fe...