Sciweavers

6740 search results - page 997 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
RSS
2007
147views Robotics» more  RSS 2007»
15 years 8 months ago
Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning
Abstract— This paper presents the Discrete Search Leading continuous eXploration (DSLX) planner, a multi-resolution approach to motion planning that is suitable for challenging p...
Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi
CIC
2006
101views Communications» more  CIC 2006»
15 years 8 months ago
Non Blocking OVSF Codes Influence The Performance Of WCDMA System
In this paper the performance of OVSF and NOVSF codes in WCDMA are evaluated by calculating their blocking probability and plotting graphs between blocking probability and new call...
Shailendra Mishra, Nipur
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
15 years 6 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
CORR
2010
Springer
103views Education» more  CORR 2010»
15 years 5 months ago
Structural Solutions to Dynamic Scheduling for Multimedia Transmission in Unknown Wireless Environments
In this paper, we propose a systematic solution to the problem of scheduling delay-sensitive media data for transmission over time-varying wireless channels. We first formulate th...
Fangwen Fu, Mihaela van der Schaar
PRL
2010
188views more  PRL 2010»
15 years 5 months ago
Sparsity preserving discriminant analysis for single training image face recognition
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...
Lishan Qiao, Songcan Chen, Xiaoyang Tan