Sciweavers

1760 search results - page 255 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
IVC
2000
113views more  IVC 2000»
13 years 7 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...
FCT
2003
Springer
14 years 1 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
DFG
2001
Springer
14 years 11 days ago
Interactive medical 3D-simulations by means of stereoscopy and standard hardware
: Using stereo-3D hardware in its different solutions is not new, but most available applications use these Hardware only for a better visualization of 3d-reconstructions. It is an...
Kay Melzer, Hans-Gerd Lipinski, Dietrich H. W. Gr&...
INFOCOM
2007
IEEE
14 years 2 months ago
Separability and Topology Control of Quasi Unit Disk Graphs
— A deep understanding of the structural properties of wireless networks is critical for evaluating the performance of network protocols and improving their designs. Many protoco...
Jianer Chen, Anxiao Jiang, Iyad A. Kanj, Ge Xia, F...
PRL
2010
188views more  PRL 2010»
13 years 2 months ago
A fast divisive clustering algorithm using an improved discrete particle swarm optimizer
As an important technique for data analysis, clustering has been employed in many applications such as image segmentation, document clustering and vector quantization. Divisive cl...
Liang Feng, Ming-Hui Qiu, Yu-Xuan Wang, Qiao-Liang...