5100 search results - page 572 / 1020 » The Linear Complexity of a Graph |
182
click to vote
IACR
2011
14 years 6 months ago
2011
Traditional approaches to secure computation begin by representing the function f being computed as a circuit. For any function f that depends on each of its inputs, this implies ...
243
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
Saliency estimation has become a valuable tool in image processing. Yet, existing approaches exhibit considerable variation in methodology, and it is often difficult to attribute...
169
click to vote
ISQED
2008
IEEE
16 years 1 months ago
2008
IEEE
Clock meshes have found increasingly wide applications in today’s high-performance IC designs. The inherent routing redundancies associated with clock meshes lead to improved cl...
192
click to vote
INFOCOM
2008
IEEE
16 years 1 months ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...
204
click to vote
ISAAC
2007
Springer
16 years 29 days ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...