Sciweavers

30 search results - page 4 / 6
» Computing the set of all distant horizons of a terrain
Sort
View
JITECH
2007
136views more  JITECH 2007»
13 years 7 months ago
A computer scientist's reactions to NPfIT
This paper contains a set of personal views relating to NHS Connecting for Health’s National Programme for IT (NPfIT), and in particular its Care Records Service, written from t...
Brian Randell
IMR
2004
Springer
14 years 22 days 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
EWRL
2008
13 years 9 months ago
Optimistic Planning of Deterministic Systems
If one possesses a model of a controlled deterministic system, then from any state, one may consider the set of all possible reachable states starting from that state and using any...
Jean-François Hren, Rémi Munos
PODC
2004
ACM
14 years 24 days ago
Analyzing Kleinberg's (and other) small-world Models
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
Charles U. Martel, Van Nguyen
ICCV
2001
IEEE
14 years 9 months ago
Lambertian Reflectance and Linear Subspaces
We prove that the set of all Lambertian reflectance functions (the mapping from surface normals to intensities) obtained with arbitrary distant light sources lies close to a 9D lin...
Ronen Basri, David W. Jacobs