Sciweavers

821 search results - page 25 / 165
» Addressing the Petersen graph
Sort
View
TOG
2008
100views more  TOG 2008»
14 years 11 months ago
Interactive procedural street modeling
This paper addresses the problem of interactively modeling large street networks. We introduce a modeling framework that uses tensor fields to guide the generation of a street gra...
Guoning Chen, Gregory Esch, Peter Wonka, Pascal M&...
PLDI
2011
ACM
14 years 2 months ago
The tao of parallelism in algorithms
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regular...
Keshav Pingali, Donald Nguyen, Milind Kulkarni, Ma...
CAV
2011
Springer
216views Hardware» more  CAV 2011»
14 years 3 months ago
Malware Analysis with Tree Automata Inference
Abstract. The underground malware-based economy is flourishing and it is evident that the classical ad-hoc signature detection methods are becoming insufficient. Malware authors ...
Domagoj Babic, Daniel Reynaud, Dawn Song
IUI
2011
ACM
14 years 2 months ago
Groups without tears: mining social topologies from email
As people accumulate hundreds of “friends” in social media, a flat list of connections becomes unmanageable. Interfaces agnostic to social structure hinder the nuanced sharin...
Diana MacLean, Sudheendra Hangal, Seng Keat Teh, M...
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
13 years 2 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...