1629 search results - page 122 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
CVPR
2006
IEEE
16 years 16 hour ago
2006
IEEE
This paper presents a new volumetric stereo algorithm to reconstruct the 3D shape of an arbitrary object. Our method is based on finding the minimum cut in an octahedral graph str...
101
click to vote
ICDM
2010
IEEE
14 years 8 months ago
2010
IEEE
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
ASPDAC
2010
ACM
14 years 8 months ago
2010
ACM
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
DIALM
2004
ACM
15 years 1 months ago
2004
ACM
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
SIGMOD
2010
ACM
14 years 10 months ago
2010
ACM
Rising energy costs in large data centers are driving an agenda for energy-efficient computing. In this paper, we focus on the role of database software in affecting, and, ultimat...