Sciweavers

1095 search results - page 115 / 219
» A Parallel Algorithm for Computing Betweenness Centrality
Sort
View
EOR
2008
52views more  EOR 2008»
15 years 4 months ago
Competitive online scheduling of perfectly malleable jobs with setup times
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
Jessen T. Havill, Weizhen Mao
BIOINFORMATICS
2005
140views more  BIOINFORMATICS 2005»
15 years 4 months ago
Profile-based direct kernels for remote homology detection and fold recognition
Motivation: Remote homology detection between protein sequences is a central problem in computational biology. Supervised learning algorithms based on support vector machines are ...
Huzefa Rangwala, George Karypis
IPPS
2006
IEEE
15 years 11 months ago
Reconfigurable communications for image processing applications
: This work tries to reuse programmable communication resources like a Network-on-Chip (NoC) in the acceleration of image applications. We show a mathematical model for the computa...
André Borin Soares, Luigi Carro, Altamiro A...
ICDCS
1996
IEEE
15 years 9 months ago
Making Trust Explicit in Distributed Commerce Transactions
In a distributed environment where nodes are independently motivated, many transactions or commercial exchanges may be stymied due to a lack of trust between the participants. The...
Steven P. Ketchpel, Hector Garcia-Molina
IPPS
1996
IEEE
15 years 9 months ago
A Class of Interconnection Networks for Multicasting
Multicast, or one-to-many, communication arises frequently in parallel computing and telecommunication applications. Multicast networks can simultaneously support multiple multicas...
Yuanyuan Yang