Sciweavers

364 search results - page 68 / 73
» Computing Communities in Large Networks Using Random Walks
Sort
View
IPPS
2003
IEEE
15 years 2 months ago
Autonomous Protocols for Bandwidth-Centric Scheduling of Independent-Task Applications
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
Barbara Kreaseck, Larry Carter, Henri Casanova, Je...
99
Voted
IWVF
2001
Springer
15 years 1 months ago
Volume and Surface Area Distributions of Cracks in Concrete
Volumetric images of small mortar samples under load are acquired by X-ray microtomography. The images are binarized at many different threshold values, and over a million connecte...
George Nagy, Tong Zhang, W. R. Franklin, Eric Land...
MIDDLEWARE
2007
Springer
15 years 3 months ago
Dynamic multi-process information flow tracking for web application security
Although there is a large body of research on detection and prevention of such memory corruption attacks as buffer overflow, integer overflow, and format string attacks, the web...
Susanta Nanda, Lap-Chung Lam, Tzi-cker Chiueh
CVPR
2008
IEEE
15 years 3 months ago
Scene understanding with discriminative structured prediction
Spatial priors play crucial roles in many high-level vision tasks, e.g. scene understanding. Usually, learning spatial priors relies on training a structured output model. In this...
Jinhui Yuan, Jianmin Li, Bo Zhang
102
Voted
HIPC
2007
Springer
15 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri