811 search results - page 60 / 163 » Flow Theory: An Enhancement |
MCS
2006
Springer
13 years 8 months ago
2006
Springer
For interface-tracking simulation of two-phase flows, we propose a new computational method, NS-PFM, combining Navier-Stokes (NS) equations with phase-field model (PFM). Based on ...
ICFP
2007
ACM
14 years 8 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
BMCBI
2010
13 years 9 months ago
2010
Background: There are many important clustering questions in computational biology for which no satisfactory method exists. Automated clustering algorithms, when applied to large,...
SIGMETRICS
2012
ACM
11 years 11 months ago
2012
ACM
Sampling is crucial for controlling resource consumption by internet traffic flow measurements. Routers use Packet Sampled NetFlow [9], and completed flow records are sampled in...
INFOCOM
2006
IEEE
14 years 2 months ago
2006
IEEE
— Monitoring the traffic in high-speed networks is a data intensive problem. Uniform packet sampling is the most popular technique for reducing the amount of data the network mo...