Sciweavers

3874 search results - page 380 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
HPCC
2005
Springer
15 years 11 months ago
A Threshold-Based Matching Algorithm for Photonic Clos Network Switches
This study concerns a threshold-based matching algorithm for Clos (t-MAC) network switches. The studied Clos network uses a central photonic switch fabric for transporting high-spe...
Ding-Jyh Tsaur, Chi-Feng Tang, Chin-Chi Wu, Woei L...
217
Voted
INFOCOM
2007
IEEE
16 years 15 days ago
Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks
— In this paper, we propose and study a general framework that allows the development of distributed mechanisms to achieve full utilization of multi-hop wireless networks. In par...
Atilla Eryilmaz, Asuman E. Ozdaglar, Eytan Modiano
DAC
2006
ACM
16 years 5 days ago
A fast on-chip decoupling capacitance budgeting algorithm using macromodeling and linear programming
We propose a novel and efficient charge-based decoupling capacitance budgeting algorithm. Our method uses the macromodeling technique and effective radius of decoupling capacitan...
Min Zhao, Rajendran Panda, Savithri Sundareswaran,...
KDD
1997
ACM
159views Data Mining» more  KDD 1997»
15 years 9 months ago
New Algorithms for Fast Discovery of Association Rules
Discovery of association rules is an important problem in database mining. In this paper we present new algorithms for fast association mining, which scan the database only once, ...
Mohammed Javeed Zaki, Srinivasan Parthasarathy, Mi...
IJCAI
2003
15 years 7 months ago
Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems
The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in...
Christophe Jermann, Bertrand Neveu, Gilles Trombet...