Sciweavers

3928 search results - page 431 / 786
» order 2006
Sort
View
IJCM
2002
92views more  IJCM 2002»
15 years 7 months ago
Random-tree Diameter and the Diameter-constrained MST
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
Ayman Abdalla, Narsingh Deo
COMBINATORICS
1998
79views more  COMBINATORICS 1998»
15 years 7 months ago
A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments
Voltage graphs are a powerful tool for constructing large graphs (called lifts) with prescribed properties as covering spaces of small base graphs. This makes them suitable for ap...
Ljiljana Brankovic, Mirka Miller, Ján Plesn...
IJCV
2002
148views more  IJCV 2002»
15 years 7 months ago
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
Stereo matching is one of the most active research areas in computer vision. While a large number of algorithms for stereo correspondence have been developed, relatively little wo...
Daniel Scharstein, Richard Szeliski
IJON
2002
154views more  IJON 2002»
15 years 7 months ago
Nonlinear model predictive control of a cutting process
Nonlinear model predictive control (MPC) of a simulated chaotic cutting process is presented. The nonlinear MPC combines a neural-network model and a genetic-algorithm-based optim...
Primoz Potocnik, Igor Grabec
IJWIN
2002
154views more  IJWIN 2002»
15 years 7 months ago
Connection Admission Control for PCS-to-Internet Protocol Internetworking
This paper studies the connection admission control for PCS-to-Internet protocol internetworking. In order to provide QoS to the Internet and avoid scalability problems, several re...
Fei Yu, Victor C. M. Leung