Sciweavers

411 search results - page 38 / 83
» A New Approach to the Rectilinear Steiner Tree Problem
Sort
View
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
15 years 1 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo
IV
2005
IEEE
81views Visualization» more  IV 2005»
15 years 3 months ago
A New Force-Directed Graph Drawing Method Based on Edge-Edge Repulsion
The conventional force-directed methods for drawing undirected graphs are based on either vertex-vertex repulsion or vertex-edge repulsion. In this paper, we propose a new force-d...
Chun-Cheng Lin, Hsu-Chun Yen
CVPR
2006
IEEE
15 years 3 months ago
New Method of Probability Density Estimation with Application to Mutual Information Based Image Registration
We present a new, robust and computationally efficient method for estimating the probability density of the intensity values in an image. Our approach makes use of a continuous r...
Ajit Rajwade, Arunava Banerjee, Anand Rangarajan
DATE
2008
IEEE
143views Hardware» more  DATE 2008»
15 years 4 months ago
Improving Synthesis of Compressor Trees on FPGAs via Integer Linear Programming
Multi-input addition is an important operation for many DSP and video processing applications. On FPGAs, multi-input addition has traditionally been implemented using trees of car...
Hadi Parandeh-Afshar, Philip Brisk, Paolo Ienne
IPPS
2007
IEEE
15 years 4 months ago
Strategies for Replica Placement in Tree Networks
In this paper, we discuss and compare several policies to place replicas in tree networks, subject to server capacity constraints. The client requests are known beforehand, while ...
Anne Benoit, Veronika Rehn, Yves Robert