Sciweavers

284 search results - page 44 / 57
» On Some Polyhedra Covering Problems
Sort
View
ALENEX
2001
215views Algorithms» more  ALENEX 2001»
13 years 10 months ago
An Empirical Study of a New Approach to Nearest Neighbor Searching
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
Songrit Maneewongvatana, David M. Mount
BSDCON
2003
13 years 10 months ago
Reasoning about SMP in FreeBSD
While the subject of SMP locking primitives has been well covered in the literature [Val][Schm][Bald][Leh], there has been relatively little discussion on the rationale and proces...
Jeffrey Hsu
ECIS
2001
13 years 10 months ago
The Requirements of Methodologies for Developing Web Applications
The Internet has had a significant impact on the process of developing information systems. However, there has been little research that has examined specifically the role of deve...
Craig Standing
WSCG
2004
145views more  WSCG 2004»
13 years 10 months ago
Introducing Sweep Features in Modeling with Subdivision Surfaces
In recent times, subdivision surfaces have been considered a powerful representation for shape design. They have been successfully introduced in character animation software packa...
Chiara Eva Catalano, Franca Giannini, Bianca Falci...
MVA
1996
118views Computer Vision» more  MVA 1996»
13 years 10 months ago
Correlation-Based Visual Tracking Enhanced by Affine Motion Description
Since conventional correlation-based visual tracking algorithms are based on a single reference block, they often fail to track a target in the following situations: 1) a view of ...
Yoshihisa Adachi, Minoru Asada, Takayuki Nakamura