Sciweavers

1950 search results - page 16 / 390
» Informative sampling for large unbalanced data sets
Sort
View
IMR
2004
Springer
14 years 1 months ago
Entkerner: A System for Removal of Globally Invisible Triangles from Large Meshes
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
Manfred Ernst, Frank Firsching, Roberto Grosso
MASCOTS
2004
13 years 9 months ago
Mining Performance Data from Sampled Event Traces
The prominent role of the memory hierarchy as one of the major bottlenecks in achieving good program performance has motivated the search for ways of capturing the memory performa...
Ricardo Portillo, Diana Villa, Patricia J. Teller,...
SIGIR
2008
ACM
13 years 7 months ago
A simple and efficient sampling method for estimating AP and NDCG
We consider the problem of large scale retrieval evaluation. Recently two methods based on random sampling were proposed as a solution to the extensive effort required to judge te...
Emine Yilmaz, Evangelos Kanoulas, Javed A. Aslam
AAAI
2010
13 years 9 months ago
Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search
Perfect Information Monte Carlo (PIMC) search is a practical technique for playing imperfect information games that are too large to be optimally solved. Although PIMC search has ...
Jeffrey Richard Long, Nathan R. Sturtevant, Michae...
WSCG
2004
143views more  WSCG 2004»
13 years 9 months ago
View Dependent Stochastic Sampling for Efficient Rendering of Point Sampled Surfaces
In this paper we present a new technique for rendering very large datasets representing point-sampled surfaces. Rendering efficiency is considerably improved by using stochastic s...
Sushil Bhakar, Liang Luo, Sudhir P. Mudur