Sciweavers

362 search results - page 17 / 73
» Evaluating use of data flow systems for large graph analysis
Sort
View
ICDAR
2009
IEEE
13 years 5 months ago
Symbol Detection Using Region Adjacency Graphs and Integer Linear Programming
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...
Pierre Le Bodic, Hervé Locteau, Séba...
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
14 years 8 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
SCAM
2002
IEEE
14 years 18 days ago
Precise Call Graph Construction in the Presence of Function Pointers
The use of pointers presents serious problems for software productivity tools for software understanding, restructuring, and testing. Pointers enable indirect memory accesses thro...
Ana Milanova, Atanas Rountev, Barbara G. Ryder
IWSSD
2000
IEEE
14 years 2 days ago
Specification, Safety and Reliability Analysis Using Stochastic Petri Net Models
In this study we focus on the specification and assessment of Stochastic Petri net (SPN) models to evaluate the design of an embedded system for reliability and availability. The ...
Frederick T. Sheldon, Stefan Greiner, Matthias Ben...
ESANN
2004
13 years 9 months ago
Data Mining Techniques on the Evaluation of Wireless Churn
This work focuses on one of the most critical issues to plague the wireless telecommunications industry today: the loss of a valuable subscriber to a competitor, also defined as ch...
Jorge Ferreira, Marley B. R. Vellasco, Marco Aur&e...