Sciweavers

3678 search results - page 211 / 736
» On the Stable Paths Problem
Sort
View
143
Voted
WWW
2007
ACM
16 years 4 months ago
SPARQ2L: towards support for subgraph extraction queries in rdf databases
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
SPAA
2004
ACM
15 years 9 months ago
Cache-oblivious shortest paths in graphs using buffer heap
We present the Buffer Heap (BH), a cache-oblivious priority queue that supports Delete-Min, Delete, and Decrease-Key operations in O( 1 B log2 N B ) amortized block transfers fro...
Rezaul Alam Chowdhury, Vijaya Ramachandran
VTC
2006
IEEE
129views Communications» more  VTC 2006»
15 years 10 months ago
A Framework for Automatic Clustering of Parametric MIMO Channel Data Including Path Powers
— We present a solution to the problem of identifying clusters from MIMO measurement data in a data window, with a minimum of user interaction. Conventionally, visual inspection ...
Nicolai Czink, Pierluigi Cera, Jari Salo, Ernst Bo...
152
Voted
WAOA
2005
Springer
86views Algorithms» more  WAOA 2005»
15 years 9 months ago
SONET ADMs Minimization with Divisible Paths
We consider an optical routing problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET /WDM rings. The number of SONET ADMs required by a set of traffic...
Leah Epstein, Asaf Levin
INFOCOM
2003
IEEE
15 years 9 months ago
Network Management Information For Light-Path Assessment: Trade-off between Performance and Complexity
We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what...
Guanglei Liu, Chuanyi Ji, Vincent W. S. Chan