Sciweavers

10608 search results - page 603 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
DAC
2004
ACM
16 years 8 months ago
Synthesizing interconnect-efficient low density parity check codes
Error correcting codes are widely used in communication and storage applications. Codec complexity has usually been measured with a software implementation in mind. A recent hardw...
Marghoob Mohiyuddin, Amit Prakash, Adnan Aziz, Way...
ICCAD
2002
IEEE
103views Hardware» more  ICCAD 2002»
16 years 4 months ago
A realistic variable voltage scheduling model for real-time applications
Voltage scheduling is indispensable for exploiting the benefit of variable voltage processors. Though extensive research has been done in this area, current processor limitations...
Bren Mochocki, Xiaobo Sharon Hu, Gang Quan
ICASSP
2009
IEEE
16 years 1 months ago
Rate-distortion optimized bitstream extractor for motion scalability in scalable video coding
Motion scalability is designed to improve the coding efficiency of a scalable video coding framework, especially in the medium to low range of decoding bit rates or spatial resol...
Meng-Ping Kao, Truong Nguyen
ALDT
2009
Springer
162views Algorithms» more  ALDT 2009»
16 years 1 months ago
Compact Preference Representation in Stable Marriage Problems
Abstract. The stable marriage problem has many practical applications in twosided markets like those that assign doctors to hospitals, students to schools, or buyers to vendors. Mo...
Enrico Pilotto, Francesca Rossi, Kristen Brent Ven...
IROS
2008
IEEE
142views Robotics» more  IROS 2008»
16 years 1 months ago
Apprenticeship learning for motion planning with application to parking lot navigation
— Motion and path-planning algorithms often use complex cost functions for both global navigation and local smoothing of trajectories. Obtaining good results typically requires c...
Pieter Abbeel, Dmitri Dolgov, Andrew Y. Ng, Sebast...