3378 search results - page 60 / 676 » A universe of binding and computation |
SCHEDULING
2010
14 years 4 months ago
2010
GD
2007
Springer
15 years 3 months ago
2007
Springer
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this ...
PDCAT
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Beowulf-class clusters use a diverse collection of queue management software, and interconnect technology, often causing inter-cluster operability issues. We present a Un...
117
click to vote
NAR
2000
14 years 9 months ago
2000
Maintained at the University of Texas Health Science Center at Tyler, Texas, the tmRNA database (tmRDB) is accessible at the URL http://psyche.uthct.edu/dbs/ tmRDB/tmRDB.html with...
ALENEX
2010
14 years 11 months ago
2010
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...