3637 search results - page 132 / 728 » On Dynamic Bit-Probe Complexity |
SIAMCOMP
2010
13 years 4 months ago
2010
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
TIM
2010
13 years 4 months ago
2010
In the last few years, the growing complexity of the electrical power networks, mainly due to the increased use of electronic converters together with the requirements of a higher ...
ICMCS
2000
IEEE
14 years 1 months ago
2000
IEEE
Most of the existing work on modeling variable bit rate (VBR) video sources does not either explicitly take into account groupof-pictures (GOP) or assumes a fixed GOP structure. R...
IATA
1998
Springer
14 years 1 months ago
1998
Springer
Routing as well as the management of communicationnetworks that support hybrid types of communications requiring quality of service is a very hard problem. We present here a frame...
FPL
2009
Springer
14 years 1 months ago
2009
Springer
Preemptive multitasking, a popular technique for timesharing of computational resources in software-based systems, faces considerable difficulties when applied to partially reconf...