28888 search results - page 5550 / 5778 » Computability and complexity in analysis |
127
Voted
VLSID
2006
IEEE
16 years 4 months ago
2006
IEEE
SoC design methodologies are under constant revision due to adoption of fast shrinking process technologies at nanometer levels. Nanometer process geometries exhibit new complex d...
157
Voted
VLSID
2004
IEEE
16 years 4 months ago
2004
IEEE
As chip complexity grows, design productivity boost is expected from reuse of large parts and blocks of previous designs with the design effort largely invested into the new parts...
137
Voted
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Range searching is among the most fundamental problems in computational geometry. An n-element point set in Rd is given along with an assignment of weights to these points from so...
132
Voted
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We consider the problem of randomness extraction from independent sources. We construct an extractor that can extract from a constant number of independent sources of length n, ea...
126
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...