Sciweavers

64 search results - page 2 / 13
» Compiler-Directed I O Optimization
Sort
View
ESA
2008
Springer
96views Algorithms» more  ESA 2008»
13 years 6 months ago
Stabbing Convex Polygons with a Segment or a Polygon
Let O = {O1, . . . , Om} be a set of m convex polygons in R2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without refle...
Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. G...
ICALP
2010
Springer
13 years 9 months ago
SDP Gaps for 2-to-1 and Other Label-Cover Variants
In this paper we present semidefinite programming (SDP) gap instances for the following variants of the Label-Cover problem, closely related to the Unique Games Conjecture: (i) 2-...
Venkatesan Guruswami, Subhash Khot, Ryan O'Donnell...
HIPC
1999
Springer
13 years 9 months ago
Microcaches
We describe a radically new cache architecture and demonstrate that it offers a huge reduction in cache cost, size and power consumption whilst maintaining performance on a wide ra...
David May, Dan Page, James Irwin, Henk L. Muller
TSP
2011
144views more  TSP 2011»
12 years 11 months ago
On Decentralized Detection With Partial Information Sharing Among Sensors
—We study a decentralized detection architecture in which each of a set of sensors transmits a highly compressed summary of its observations (a binary message) to a fusion center...
O. Patrick Kreidl, John N. Tsitsiklis, Spyros I. Z...
CGO
2010
IEEE
13 years 11 months ago
Automated just-in-time compiler tuning
Managed runtime systems, such as a Java virtual machine (JVM), are complex pieces of software with many interacting components. The Just-In-Time (JIT) compiler is at the core of t...
Kenneth Hoste, Andy Georges, Lieven Eeckhout