Sciweavers

1871 search results - page 297 / 375
» The Ephemeral Pairing Problem
Sort
View
TON
1998
145views more  TON 1998»
15 years 6 months ago
Adaptive wavelength routing in all-optical networks
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...
Ahmed Mokhtar, Murat Azizoglu
TCAD
2002
134views more  TCAD 2002»
15 years 6 months ago
Testing and diagnosis of interconnect faults in cluster-based FPGA architectures
As IC densities are increasing, cluster-based FPGA architectures are becoming the architecture of choice for major FPGA manufacturers. A cluster-based architecture is one in which...
Ian G. Harris, Russell Tessier
TELSYS
2002
73views more  TELSYS 2002»
15 years 6 months ago
Avoiding Counting to Infinity in Distance Vector Routing
The Routing Information Protocol (RIP) may introduce misleading routing information into the routing table, due to network topology changes such as link or router failures. This is...
Andreas Schmid, Christoph Steigner
CVPR
2009
IEEE
17 years 23 days ago
D - Clutter: Building object model library from unsupervised segmentation of cluttered scenes
Autonomous systems which learn and utilize a limited visual vocabulary have wide spread applications. Enabling such systems to segment a set of cluttered scenes into objects is ...
Chandra Kambhamettu, Dimitris N. Metaxas, Gowri So...
CORR
2010
Springer
107views Education» more  CORR 2010»
15 years 5 months ago
Maximum Betweenness Centrality: Approximability and Tractable Cases
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
Martin Fink, Joachim Spoerhase