Sciweavers

1913 search results - page 282 / 383
» Using Data Mining in MURA Graphic Problems
Sort
View
PDP
2002
IEEE
15 years 8 months ago
Scalable Monitoring and Configuration Tools for Grids and Clusters
We present the Ka-admin project that addresses the problem of collecting, visualizing and feeding back any grid information, trace or snapshot, compliant to an XML-like model. Rea...
Philippe Augerat, Cyrill Martin, Benhur Stein
KDD
2009
ACM
191views Data Mining» more  KDD 2009»
16 years 4 months ago
Scalable pseudo-likelihood estimation in hybrid random fields
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
Antonino Freno, Edmondo Trentin, Marco Gori
CAD
2000
Springer
15 years 3 months ago
Time-critical multiresolution rendering of large complex models
Very large and geometrically complex scenes, exceeding millions of polygons and hundreds of objects, arise naturally in many areas of interactive computer graphics. Time-critical ...
Enrico Gobbetti, Eric Bouvier
159
Voted
TITS
2011
165views more  TITS 2011»
14 years 10 months ago
Robust Inference of Principal Road Paths for Intelligent Transportation Systems
Abstract—Over the last few years, electronic vehicle guidance systems have become increasingly more popular. However, despite their ubiquity, performance will always be subject t...
Gabriel Agamennoni, Juan Nieto, Eduardo Mario Nebo...
157
Voted
SDM
2008
SIAM
161views Data Mining» more  SDM 2008»
15 years 4 months ago
Efficient Maximum Margin Clustering via Cutting Plane Algorithm
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
Bin Zhao, Fei Wang, Changshui Zhang