Sciweavers

2474 search results - page 294 / 495
» Solving Problems on Parallel Computers by Cellular Programmi...
Sort
View
165
Voted
IPPS
2005
IEEE
15 years 12 months ago
Tight Bounds for Wavelength Assignment on Trees of Rings
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
Zhengbing Bian, Qian-Ping Gu, Xiao Zhou
SC
2005
ACM
15 years 12 months ago
Dynamic Data-Driven Inversion For Terascale Simulations: Real-Time Identification Of Airborne Contaminants
In contrast to traditional terascale simulations that have known, fixed data inputs, dynamic data-driven (DDD) applications are characterized by unknown data and informed by dynam...
Volkan Akcelik, George Biros, Andrei Draganescu, J...
ECCV
1998
Springer
16 years 8 months ago
Matching Hierarchical Structures Using Association Graphs
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
NIPS
2003
15 years 7 months ago
Convex Methods for Transduction
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
Tijl De Bie, Nello Cristianini
IPPS
2000
IEEE
15 years 10 months ago
Wavelengths Requirement for Permutation Routing in All-Optical Multistage Interconnection Networks
Previous studies showed that the cross-talk problem on the all-optical networks exists at both links and switches of the networks. To solve the cross-talk problem at both links and...
Qian-Ping Gu, Shietung Peng