Sciweavers

1291 search results - page 189 / 259
» Arithmetic program paths
Sort
View
86
Voted
ICSE
2009
IEEE-ACM
16 years 1 months ago
Modular string-sensitive permission analysis with demand-driven precision
In modern software systems, programs are obtained by dynamically assembling components. This has made it necessary to subject component providers to access-control restrictions. W...
Emmanuel Geay, Marco Pistoia, Takaaki Tateishi, Ba...
74
Voted
CHI
2005
ACM
16 years 1 months ago
Why CHI fragmented
I have been active in SIGCHI since 1983, serving on the Executive Committee and many conference and program committees. After editing ACM TOCHI for six years, I explored the histo...
Jonathan Grudin
94
Voted
VLSID
2002
IEEE
160views VLSI» more  VLSID 2002»
16 years 1 months ago
An Efficient Hierarchical Timing-Driven Steiner Tree Algorithm for Global Routing
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
Jingyu Xu, Xianlong Hong, Tong Jing, Yici Cai, Jun...
ICALP
2009
Springer
16 years 1 months ago
On Cartesian Trees and Range Minimum Queries
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
Erik D. Demaine, Gad M. Landau, Oren Weimann
89
Voted
CLUSTER
2008
IEEE
15 years 7 months ago
OpenMP-centric performance analysis of hybrid applications
—Several performance analysis tools support hybrid applications. Most originated as MPI profiling or tracing tools and OpenMP capabilities were added to extend the performance a...
Karl Fürlinger, Shirley Moore