Sciweavers

5100 search results - page 611 / 1020
» The Linear Complexity of a Graph
Sort
View
ECCC
2000
140views more  ECCC 2000»
15 years 6 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
ECCC
2010
87views more  ECCC 2010»
15 years 4 months ago
Testing monotonicity of distributions over general partial orders
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfe...
ICIP
2005
IEEE
16 years 8 months ago
Color signal decomposition method using 3-D Gamut boundary of multi-primary display
Color signal decomposition method is to decompose the conventional three-primary colors(RGB) into the multiprimary control values of multi-primary display(MPD) under the constraint...
Dong-Woo Kang, Yang-Ho Cho, Myong-Young Lee, Tae-Y...
ICFP
2008
ACM
16 years 6 months ago
Functional netlists
In efforts to overcome the complexity of the syntax and the lack of formal semantics of conventional hardware description languages, a number of functional hardware description la...
Sungwoo Park, Jinha Kim, Hyeonseung Im
ICRA
2007
IEEE
143views Robotics» more  ICRA 2007»
16 years 1 months ago
Inverse Depth to Depth Conversion for Monocular SLAM
— Recently it has been shown that an inverse depth parametrization can improve the performance of real-time monocular EKF SLAM, permitting undelayed initialization of features at...
Javier Civera, Andrew J. Davison, J. M. M. Montiel