Sciweavers

163 search results - page 25 / 33
» Fast Edge-Routing for Large Graphs
Sort
View
ICOIN
2005
Springer
15 years 5 months ago
RWA on Scheduled Lightpath Demands in WDM Optical Transport Networks with Time Disjoint Paths
Abstract. In optical networks, traffic demands often demonstrate periodic nature for which time-overlapping property can be utilized in routing and wavelength assignment (RWA). A R...
Hyun Gi Ahn, Tae-Jin Lee, Min Young Chung, Hyunseu...
APDC
1997
15 years 1 months ago
A Parallel Algorithm for Optimal Task Assignment in Distributed Systems
' An efficient assignment of tasks to the processors is imperative for achieving a fast job turnaround time in a parallel or distributed enviornment. The assignment problem is...
Ishfaq Ahmad, Muhammad Kafil
VLSID
2002
IEEE
105views VLSI» more  VLSID 2002»
16 years 6 days ago
A Heuristic for Clock Selection in High-Level Synthesis
Clock selection has a significant impact on the performance and quality of designs in high-level synthesis. In most synthesis systems, a convenient value of the clock is chosen or...
J. Ramanujam, Sandeep Deshpande, Jinpyo Hong, Mahm...
CVPR
1997
IEEE
15 years 4 months ago
FOCUS: Searching for Multi-colored Objects in a Diverse Image Database
We describe a new multi-phase, color-based image retrieval system, FOCUS Fast Object Color-based qUery System, with an online user interface which is capable of identifying mult...
Madirakshi Das, Edward M. Riseman, Bruce A. Draper
FTTCS
2006
132views more  FTTCS 2006»
14 years 11 months ago
Algorithms and Data Structures for External Memory
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
Jeffrey Scott Vitter