Sciweavers

1632 search results - page 222 / 327
» Sublinear Time Algorithms for Metric Space Problems
Sort
View
TCOM
2008
81views more  TCOM 2008»
15 years 3 months ago
On optimal computation of MPLS label binding for multipoint-to-point connections
Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of under...
Fernando Solano, Ramón Fabregat, José...
ICCAD
2005
IEEE
110views Hardware» more  ICCAD 2005»
16 years 22 days ago
Computational geometry based placement migration
Placement migration is a critical step to address a variety of postplacement design closure issues, such as timing, routing congestion, signal integrity, and heat distribution. To...
Tao Luo, Haoxing Ren, Charles J. Alpert, David Zhi...
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
15 years 10 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
ICC
2007
IEEE
126views Communications» more  ICC 2007»
15 years 10 months ago
Evaluation of Grouping Strategies for an Hierarchical SDMA/TDMA Scheduling Process
Abstract— Adding SDMA capabilities to modern wireless communication systems like IEEE 802.16 WiMAX promises high system capacity gains but raises the problem of combining orthogo...
Christian Hoymann, Jan Ellenbeck, Ralf Pabst, Marc...
AINA
2004
IEEE
15 years 7 months ago
On the Performance of Heuristic H MCOP for Multi-Constrained Optimal-Path QoS Routing
Network services for finding a feasible or an optimal path subject to multiple constraints on performance metrics such as delay, jitter, loss probability, etc. give rise to multip...
Gang Feng