Sciweavers

2924 search results - page 422 / 585
» Lower Bounds in Distributed Computing
Sort
View
BCB
2010
150views Bioinformatics» more  BCB 2010»
14 years 12 months ago
Enzymatic target identification with dynamic states
As a metabolic network reaches from a state to a steady state, a subset of its fluxes gradually change. The sequence of intermediate states, called the dynamic state, shows the pa...
Bin Song, Sanjay Ranka, Tamer Kahveci
CVPR
2010
IEEE
15 years 5 months ago
Fast directional chamfer matching
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
Ming-Yu Liu, Oncel Tuzel, Ashok Veeraraghavan, Ram...
CCGRID
2008
IEEE
15 years 11 months ago
A Proactive Non-Cooperative Game-Theoretic Framework for Data Replication in Data Grids
— Data grids and its cost effective nature has taken on a new level of interest in recent years; amalgamation of different providers results in increased capacity as well as lowe...
Ali Elghirani, Riky Subrata, Albert Y. Zomaya
IPPS
2007
IEEE
15 years 11 months ago
RI2N/UDP: High bandwidth and fault-tolerant network for a PC-cluster based on multi-link Ethernet
PC-clusters with high performance/cost ratio have been one of the typical platforms for high performance computing. To lower costs, Gigabit Ethernet is often used for intercommuni...
Takayuki Okamoto, Shin'ichi Miura, Taisuke Boku, M...
CLUSTER
2006
IEEE
15 years 11 months ago
I/O Scheduling Service for Multi-Application Clusters
Distributed applications, especially the ones being I/O intensive, often access the storage subsystem in a non-sequential way (stride requests). Since such behaviors lower the ove...
Adrien Lebre, Guillaume Huard, Yves Denneulin, Prz...