379 search results - page 34 / 76 » Strong reducibility of partial numberings |
137
click to vote
ICCAD
2006
IEEE
16 years 4 days ago
2006
IEEE
Traditionally, at early design stages, leakage power is associated with the number of transistors in a design. Hence, intuitively an implementation with minimum resource usage wou...
164
click to vote
COMPSAC
2009
IEEE
16 years 26 days ago
2009
IEEE
As computing technology becomes increasingly pervasive and interconnected, mobility leads to shorter-lasting relationships between end-points with many different security requirem...
182
click to vote
DSN
2006
IEEE
16 years 5 days ago
2006
IEEE
This paper considers the eventual leader election problem in asynchronous message-passing systems where an arbitrary number t of processes can crash (t < n, where n is the tota...
177
click to vote
FOCS
2006
IEEE
16 years 5 days ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
159
click to vote
FCCM
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents three reconfigurable computing approaches for a Shape-Adaptive Template Matching (SA-TM) method to retrieve arbitrarily shaped objects within images or video f...