Sciweavers

130 search results - page 9 / 26
» Efficiently Verifiable Escape Analysis
Sort
View
SAC
2008
ACM
13 years 6 months ago
Flexible pointer analysis using assign-fetch graphs
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
Marcio Buss, Daniel Brand, Vugranam C. Sreedhar, S...
KDD
2001
ACM
231views Data Mining» more  KDD 2001»
14 years 7 months ago
A Framework for Efficient and Anonymous Web Usage Mining Based on Client-Side Tracking
Web Usage Mining (WUM), a natural application of data mining techniques to the data collected from user interactions with the web, has greatly concerned both academia and industry ...
Cyrus Shahabi, Farnoush Banaei Kashani
DAC
1998
ACM
13 years 11 months ago
OCCOM: Efficient Computation of Observability-Based Code Coverage Metrics for Functional Verification
—Functional simulation is still the primary workhorse for verifying the functional correctness of hardware designs. Functional verification is necessarily incomplete because it i...
Farzan Fallah, Srinivas Devadas, Kurt Keutzer
GIS
2009
ACM
14 years 8 months ago
Efficient Viewpoint Assignment for Urban Texture Documentation
We envision participatory texture documentation (PTD) as a process in which a group of users (dedicated individuals and/or general public) with camera-equipped mobile phones parti...
Cyrus Shahabi, Farnoush Banaei Kashani, Houtan Shi...
ENTCS
2006
172views more  ENTCS 2006»
13 years 7 months ago
Efficient Detection of Conflicts in Graph-based Model Transformation
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas