2366 search results - page 299 / 474 » Mapping time |
122
Voted
SODA
2010
ACM
16 years 29 days ago
2010
ACM
We describe an algorithm for computing planar convex hulls in the self-improving model: given a sequence I1, I2, . . . of planar n-point sets, the upper convex hull conv(I) of eac...
132
click to vote
ICCD
2003
IEEE
16 years 14 days ago
2003
IEEE
A critical problem in wide-issue superscalar processors is the limit on cycle time imposed by the central register file and operand bypass network. In this paper, a distributed re...
154
Voted
AINA
2009
IEEE
15 years 10 months ago
2009
IEEE
One of the novel benefits of virtualization is the ability to emulate many hosts with a single physical machine. This approach is often used to support at-scale testing for large...
102
Voted
MICRO
2009
IEEE
15 years 10 months ago
2009
IEEE
Building an optimising compiler is a difficult and time consuming task which must be repeated for each generation of a microprocessor. As the underlying microarchitecture changes...
111
Voted
SEMWEB
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we consider the problem of materializing the complete finite RDFS closure in a scalable manner; this includes those parts of the RDFS closure that are often ignored...