Sciweavers

30 search results - page 1 / 6
» Computing the set of all distant horizons of a terrain
Sort
View
CCCG
2004
13 years 6 months ago
Computing the set of all distant horizons of a terrain
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...
William S. Evans, Daniel Archambault, David G. Kir...
CGF
2008
124views more  CGF 2008»
13 years 5 months ago
Fast Soft Self-Shadowing on Dynamic Height Fields
We present a new, real-time method for rendering soft shadows from large light sources or lighting environments on dynamic height fields. The method first computes a horizon map f...
John Snyder, Derek Nowrouzezahrai
GIS
2007
ACM
14 years 6 months ago
Smugglers and border guards: the GeoStar project at RPI
We present the GeoStar project at RPI, which researches various terrain (i.e., elevation) representations and operations thereon. This work is motivated by the large amounts of hi...
W. Randolph Franklin, Metin Inanc, Zhongyi Xie, Da...
ACL
2010
13 years 2 months ago
All Words Domain Adapted WSD: Finding a Middle Ground between Supervision and Unsupervision
In spite of decades of research on word sense disambiguation (WSD), all-words general purpose WSD has remained a distant goal. Many supervised WSD systems have been built, but the...
Mitesh M. Khapra, Anup Kulkarni, Saurabh Sohoney, ...
AUTOMATICA
2005
108views more  AUTOMATICA 2005»
13 years 5 months ago
Enlarging the domain of attraction of MPC controllers
This paper presents a method for enlarging the domain of attraction of nonlinear model predictive control (MPC). The usual way of guaranteeing stability of nonlinear MPC is to add...
Daniel Limón, T. Alamo, Eduardo F. Camacho