Sciweavers

495 search results - page 44 / 99
» Data exchange: computing cores in polynomial time
Sort
View
VIS
2009
IEEE
300views Visualization» more  VIS 2009»
14 years 10 months ago
Predictor-Corrector Schemes for Visualization of Smoothed Particle Hydrodynamics Data
Abstract--In this paper we present a method for vortex core line extraction which operates directly on the smoothed particle hydrodynamics (SPH) representation and, by this, genera...
Benjamin Schindler, Raphael Fuchs, John Biddisco...
ICPP
2009
IEEE
14 years 3 months ago
Exploiting Simulation Slack to Improve Parallel Simulation Speed
Parallel simulation is a technique to accelerate microarchitecture simulation of CMPs by exploiting the inherent parallelism of CMPs. In this paper, we explore the simulation para...
Jianwei Chen, Murali Annavaram, Michel Dubois
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
14 years 25 days ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
14 years 9 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 1 months ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld