Sciweavers

733 search results - page 139 / 147
» An incremental space to visualize dynamic data sets
Sort
View
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 13 days ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
VISSYM
2004
13 years 9 months ago
Occlusion Culling for Sub-Surface Models in Geo-Scientific Applications
We present a three pass occlusion culling algorithm, which makes efficient use of hardware support. Our geo-scientific sub-surface data sets consist typically of a set of high res...
John Plate, Anselm Grundhöfer, Benjamin Schmi...
ECCV
2010
Springer
13 years 7 months ago
MIForests: Multiple-Instance Learning with Randomized Trees
Abstract. Multiple-instance learning (MIL) allows for training classifiers from ambiguously labeled data. In computer vision, this learning paradigm has been recently used in many ...
Christian Leistner, Amir Saffari, Horst Bischof
PLDI
2009
ACM
14 years 8 months ago
Efficiently and precisely locating memory leaks and bloat
Inefficient use of memory, including leaks and bloat, remain a significant challenge for C and C++ developers. Applications with these problems become slower over time as their wo...
Gene Novark, Emery D. Berger, Benjamin G. Zorn
FAST
2010
13 years 10 months ago
Bimodal Content Defined Chunking for Backup Streams
Data deduplication has become a popular technology for reducing the amount of storage space necessary for backup and archival data. Content defined chunking (CDC) techniques are w...
Erik Kruus, Cristian Ungureanu, Cezary Dubnicki