Sciweavers

2715 search results - page 221 / 543
» Total Generalized Variation
Sort
View
SODA
2000
ACM
114views Algorithms» more  SODA 2000»
15 years 5 months ago
The rectilinear Steiner arborescence problem is NP-complete
Given a set P of points in the first quadrant, a Rectilinear Steiner Arborescence (RSA) is a directed tree rooted at the origin, containing all points in P, and composed solely of...
Weiping Shi, Chen Su
135
Voted
ATAL
2010
Springer
15 years 5 months ago
Improving DPOP with function filtering
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed c...
Ismel Brito, Pedro Meseguer
GLVLSI
2007
IEEE
186views VLSI» more  GLVLSI 2007»
15 years 4 months ago
Block placement to ensure channel routability
Given a set of placed blocks, we present an algorithm that minimally spaces the blocks to ensure routability under several assumptions. By performing a binary search on total widt...
Shigetoshi Nakatake, Zohreh Karimi, Taraneh Taghav...
GLVLSI
2008
IEEE
197views VLSI» more  GLVLSI 2008»
15 years 4 months ago
Efficient tree topology for FPGA interconnect network
This paper presents an improved Tree-based architecture that unifies two unidirectional programmable networks: A predictible downward network based on the Butterfly-FatTree topolo...
Zied Marrakchi, Hayder Mrabet, Emna Amouri, Habib ...
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
15 years 4 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke