Sciweavers

1891 search results - page 297 / 379
» Interactive Analysis of Computer Crimes
Sort
View
SIGCOMM
1996
ACM
14 years 2 months ago
Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks
Abstract-- We present a Start-time Fair Queueing (SFQ) algorithm that is computationally efficient and achieves fairness regardless of variation in a server capacity. We analyze it...
Pawan Goyal, Harrick M. Vin, Haichen Cheng
GECCO
2000
Springer
101views Optimization» more  GECCO 2000»
14 years 1 months ago
Polynomial Time Summary Statistics for Two general Classes of Functions
In previous work we showed, by Walsh analysis, that summary statistics such as mean, variance, skew, and higher order statistics can be computed in polynomial time for embedded la...
Robert B. Heckendorn
TOG
2002
154views more  TOG 2002»
13 years 9 months ago
Image based flow visualization
A new method for the visualization of two-dimensional fluid flow is presented. The method is based on the advection and decay of dye. These processes are simulated by defining eac...
Jarke J. van Wijk
GIS
2007
ACM
14 years 4 months ago
Cell-based generalization of 3D building groups with outlier management
In this paper, we present a technique that generalizes 3D building groups of virtual 3D city models according to a cell structure that is derived from infrastructure networks. In ...
Tassilo Glander, Jürgen Döllner
IPPS
2009
IEEE
14 years 4 months ago
Coupled placement in modern data centers
We introduce the coupled placement problem for modern data centers spanning placement of application computation and data among available server and storage resources. While the t...
Madhukar R. Korupolu, Aameek Singh, Bhuvan Bamba