Sciweavers

3906 search results - page 605 / 782
» From grids to places
Sort
View
IM
2008
15 years 6 months ago
Fast and Efficient Restricted Delaunay Triangulation in Random Geometric Graphs
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
Chen Avin
CN
2007
108views more  CN 2007»
15 years 6 months ago
On the peninsula phenomenon in web graph and its implications on web search
Web masters usually place certain web pages such as home pages and index pages in front of others. Under such a design, it is necessary to go through some pages to reach the desti...
Tao Meng, Hong-Fei Yan
COMCOM
2007
136views more  COMCOM 2007»
15 years 6 months ago
A Delaunay Triangulation based method for wireless sensor network deployment
To obtain a satisfied performance of wireless sensor network, an adaptable sensor deployment method for various applications is essential. In this paper, we propose a centralized ...
Chun-Hsien Wu, Kuo-Chuan Lee, Yeh-Ching Chung
IJCV
2006
83views more  IJCV 2006»
15 years 6 months ago
Visual Acuity in Day for Night
In film production, it is sometimes not convenient or directly impossible to shoot some night scenes at night. The film budget, schedule or location may not allow it. In these cas...
Gloria Haro, Marcelo Bertalmío, Vicent Case...
COMPSEC
2007
52views more  COMPSEC 2007»
15 years 6 months ago
Privacy-preserving programming using sython
— Programmers often have access to confidential data that are not strictly needed for program development. Broad priveleges from accounts given to programmers allow them to view...
Michael Gaiman, Rahul Simha, Bhagirath Narahari