Sciweavers

3006 search results - page 309 / 602
» Dimensionality reduction and generalization
Sort
View
KDD
2002
ACM
170views Data Mining» more  KDD 2002»
16 years 7 months ago
On interactive visualization of high-dimensional data using the hyperbolic plane
: se the concept of visualizing general abstract data by intermediate projection into the hyperbolic space. Its favorable properties were reported earlier and led to the "hype...
Helge Ritter, Jörg A. Walter
INFOCOM
2005
IEEE
16 years 9 days ago
Packetostatics: deployment of massively dense sensor networks as an electrostatics problem
— We investigate the spatial distribution of wireless nodes that can transport a given volume of traffic in a sensor network, while requiring the minimum number of wireless node...
Stavros Toumpis, Leandros Tassiulas
COMGEO
2006
ACM
15 years 6 months ago
Octrees with near optimal cost 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 applica...
Hervé Brönnimann, Marc Glisse
MOC
2002
118views more  MOC 2002»
15 years 6 months ago
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problem...
Fred J. Hickernell, Xiaoqun Wang
TOG
2002
96views more  TOG 2002»
15 years 6 months ago
Robust epsilon visibility
Analytic visibility algorithms, for example methods which compute a subdivided mesh to represent shadows, are notoriously unrobust and hard to use in practice. We present a new me...
Florent Duguet, George Drettakis