Sciweavers

11565 search results - page 171 / 2313
» Computing Minimal Mappings
Sort
View
EMMCVPR
2001
Springer
15 years 9 months ago
Designing the Minimal Structure of Hidden Markov Model by Bisimulation
Hidden Markov Models (HMMs) are an useful and widely utilized approach to the modeling of data sequences. One of the problems related to this technique is finding the optimal stru...
Manuele Bicego, Agostino Dovier, Vittorio Murino
IPPS
2000
IEEE
15 years 8 months ago
Job Scheduling that Minimizes Network Contention due to both Communication and I/O
As communication and I/O traffic increase on the interconnection network of high-performance systems, network contention becomes a critical problem drastically reducing performan...
Jens Mache, Virginia Mary Lo, Sharad Garg
BIRTHDAY
2009
Springer
15 years 8 months ago
Minimizing Average Flow-Time
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg
FOCS
2007
IEEE
15 years 8 months ago
Minimizing Average Flow-time : Upper and Lower Bounds
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
Naveen Garg, Amit Kumar
CSE
2009
IEEE
15 years 7 months ago
Rotation Scheduling and Voltage Assignment to Minimize Energy for SoC
— Low energy consumption is a critical issue in embedded systems design. As the technology feature sizes of SoC (Systems on Chip) become smaller and smaller, the percentage of le...
Meikang Qiu, Laurence Tianruo Yang, Edwin Hsing-Me...