Sciweavers

1229 search results - page 233 / 246
» A New Method for Dependent Parsing
Sort
View
EUROGRAPHICS
2010
Eurographics
15 years 6 months ago
Exact and Robust (Self-)Intersections for Polygonal Meshes
We present a new technique to implement operators that modify the topology of polygonal meshes at intersections and self-intersections. Depending on the modification strategy, th...
Marcel Campen and Leif Kobbelt
ICCAD
2006
IEEE
190views Hardware» more  ICCAD 2006»
15 years 6 months ago
Factor cuts
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
CGO
2010
IEEE
15 years 4 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
CSFW
2009
IEEE
15 years 4 months ago
Inputs of Coma: Static Detection of Denial-of-Service Vulnerabilities
—As networked systems grow in complexity, they are increasingly vulnerable to denial-of-service (DoS) attacks involving resource exhaustion. A single malicious input of coma can ...
Richard M. Chang, Guofei Jiang, Franjo Ivancic, Sr...
CONCUR
2009
Springer
15 years 4 months ago
Partially-Commutative Context-Free Processes
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
Wojciech Czerwinski, Sibylle B. Fröschle, Sla...