2542 search results - page 384 / 509 » Computing Cartograms with Optimal Complexity |
LICS
2008
IEEE
14 years 4 months ago
2008
IEEE
We investigate the notions of may- and mustapproximation in Erratic Idealized Algol (a nondeterministic extension of Idealized Algol), and give explicit characterizations of both ...
SAC
2000
ACM
14 years 2 months ago
2000
ACM
The global scenario put together by communication networks determines new opportunities towards the realization of Internetbased distributed services in many complex and composite...
DAC
2007
ACM
14 years 2 months ago
2007
ACM
A growing number of networked applications is implemented on increasingly complex automotive platforms with several bus standards and gateways. Together, they challenge the automo...
RECOMB
2004
Springer
14 years 10 months ago
2004
Springer
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
FOCS
2008
IEEE
13 years 10 months ago
2008
IEEE
We consider markets in the classical Arrow-Debreu model. There are n agents and m goods. Each buyer has a concave utility function (of the bundle of goods he/she buys) and an init...