3898 search results - page 243 / 780 » On the Bit Extraction Problem |
123
click to vote
ISCAS
2008
IEEE
15 years 9 months ago
2008
IEEE
— In a nanoscale technology, memory bits are highly susceptible to process variation induced read/write failures. To address the above problem, in this paper a new memory cell is...
112
click to vote
ISPDC
2008
IEEE
15 years 9 months ago
2008
IEEE
Multi–comparand associative processors are efficient in parallel processing of complex search problems that arise from many application areas including computational geometry, ...
100
click to vote
ICC
2007
IEEE
15 years 9 months ago
2007
IEEE
— In this paper, a scheduling problem is considered in the cellular network where there exist CBR (constant bit rate) users requiring exact minimum average throughput and delay g...
128
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
121
click to vote
STACS
2007
Springer
15 years 9 months ago
2007
Springer
We study the following problem. Given a weighted planar graph G, assign labels L(v) to vertices so that given L(u), L(v) and L(x) for x ∈ X for any X ⊂ V (G), compute the dist...