Sciweavers

297 search results - page 10 / 60
» On the Fastest Vickrey Algorithm
Sort
View
FOCS
2005
IEEE
14 years 29 days ago
Group-theoretic Algorithms for Matrix Multiplication
We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically fast...
Henry Cohn, Robert D. Kleinberg, Balázs Sze...
ICMCS
2005
IEEE
85views Multimedia» more  ICMCS 2005»
14 years 29 days ago
Fast Video Motion Estimation Algorithm for Mobile Devices
The power consumption of video enabled mobile devices is an ongoing challenge. The computational burden caused by the motion estimation process involved in video compression is th...
Ho-Jae Lee, Panos Nasiopoulos, Victor C. M. Leung
ATAL
2008
Springer
13 years 9 months ago
Undominated VCG redistribution mechanisms
Many important problems in multiagent systems can be seen as resource allocation problems. For such problems, the well-known Vickrey-Clarke-Groves (VCG) mechanism is efficient, in...
Mingyu Guo, Vincent Conitzer
JACM
2002
83views more  JACM 2002»
13 years 7 months ago
Fast context-free grammar parsing requires fast boolean matrix multiplication
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG par...
Lillian Lee
ISPD
2010
ACM
205views Hardware» more  ISPD 2010»
14 years 2 months ago
Total sensitivity based dfm optimization of standard library cells
Standard cells are fundamental circuit building blocks designed at very early design stages. Nanometer standard cells are prone to lithography proximity and process variations. Ho...
Yongchan Ban, Savithri Sundareswaran, David Z. Pan