Sciweavers

2254 search results - page 410 / 451
» Computing the minimal covering set
Sort
View
ALGORITHMICA
2011
13 years 5 months ago
On Bounded Leg Shortest Paths Problems
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...
Liam Roditty, Michael Segal
VIS
2007
IEEE
80views Visualization» more  VIS 2007»
14 years 11 months ago
Topologically Clean Distance Fields
Analysis of materials obtained from physical simulations is important in the physical sciences. Our research was motivated by the need to investigate the properties of a simulated...
Attila G. Gyulassy, Mark A. Duchaineau, Vijay Na...
POPL
2003
ACM
14 years 10 months ago
Bitwidth aware global register allocation
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
Sriraman Tallam, Rajiv Gupta
PLDI
2009
ACM
14 years 4 months ago
Staged information flow for javascript
Modern websites are powered by JavaScript, a flexible dynamic scripting language that executes in client browsers. A common paradigm in such websites is to include third-party Ja...
Ravi Chugh, Jeffrey A. Meister, Ranjit Jhala, Sori...
CPAIOR
2007
Springer
14 years 4 months ago
Cost-Bounded Binary Decision Diagrams for 0-1 Programming
Abstract. In recent work binary decision diagrams (BDDs) were introduced as a technique for postoptimality analysis for integer programming. In this paper we show that much smaller...
Tarik Hadzic, John N. Hooker