Sciweavers

20066 search results - page 3717 / 4014
» T Spaces
Sort
View
KDD
2004
ACM
198views Data Mining» more  KDD 2004»
16 years 3 days ago
Mining traffic data from probe-car system for travel time prediction
We are developing a technique to predict travel time of a vehicle for an objective road section, based on real time traffic data collected through a probe-car system. In the area ...
Takayuki Nakata, Jun-ichi Takeuchi
LATIN
2004
Springer
16 years 3 days ago
Cost-Optimal Trees for Ray Shooting
Predicting and optimizing the performance of ray shooting is a very important problem in computer graphics due to the severe computational demands of ray tracing and other applicat...
Hervé Brönnimann, Marc Glisse
LATIN
2004
Springer
16 years 3 days ago
Generating Maximal Independent Sets for Hypergraphs with Bounded Edge-Intersections
Given a finite set V , and integers k ≥ 1 and r ≥ 0, denote by A(k, r) the class of hypergraphs A ⊆ 2V with (k, r)-bounded intersections, i.e. in which the intersection of a...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
LCTRTS
2004
Springer
16 years 3 days ago
Spinach: a liberty-based simulator for programmable network interface architectures
This paper presents Spinach, a new simulator toolset specifically designed to target programmable network interface architectures. Spinach models both system components that are ...
Paul Willmann, Michael Brogioli, Vijay S. Pai
OOPSLA
2004
Springer
16 years 3 days ago
The garbage collection advantage: improving program locality
As improvements in processor speed continue to outpace improvements in cache and memory speed, poor locality increasingly degrades performance. Because copying garbage collectors ...
Xianglong Huang, Stephen M. Blackburn, Kathryn S. ...
« Prev « First page 3717 / 4014 Last » Next »