Sciweavers

2262 search results - page 111 / 453
» Points with large quadrant-depth
Sort
View
VC
2008
138views more  VC 2008»
15 years 6 months ago
A GPU-based light hierarchy for real-time approximate illumination
Illumination rendering including environment lighting, indirect illumination, and subsurface scattering plays for many graphics applications such as games and VR systems. However, ...
Hyunwoo Ki, Kyoungsu Oh
AUTOMATICA
2002
104views more  AUTOMATICA 2002»
15 years 6 months ago
Who needs QP for linear MPC anyway?
Conventional MPC uses quadratic programming (QP) to minimise, on-line, a cost over n linearly constrained control moves. However, stability constraints often require the use of la...
Basil Kouvaritakis, Mark Cannon, J. Anthony Rossit...
IVC
2000
113views more  IVC 2000»
15 years 6 months ago
Matching disparate views of planar surfaces using projective invariants
Feature matching is a prerequisite to a wide variety of vision tasks. This paper presents a method that addresses the problem of matching disparate views of coplanar points and li...
Manolis I. A. Lourakis, Spyros T. Halkidis, Stelio...
VLDB
2002
ACM
144views Database» more  VLDB 2002»
15 years 6 months ago
Shooting Stars in the Sky: An Online Algorithm for Skyline Queries
Skyline queries ask for a set of interesting points from a potentially large set of data points. If we are traveling, for instance, a restaurant might be interesting if there is n...
Donald Kossmann, Frank Ramsak, Steffen Rost
CORR
2010
Springer
92views Education» more  CORR 2010»
15 years 5 months ago
Random Projections for $k$-means Clustering
This paper discusses the topic of dimensionality reduction for k-means clustering. We prove that any set of n points in d dimensions (rows in a matrix A ∈ Rn×d ) can be project...
Christos Boutsidis, Anastasios Zouzias, Petros Dri...