Sciweavers

886 search results - page 86 / 178
» Reasoning with contextual graphs
Sort
View
DATE
2010
IEEE
134views Hardware» more  DATE 2010»
15 years 9 months ago
Simultaneous budget and buffer size computation for throughput-constrained task graphs
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...
Maarten Wiggers, Marco Bekooij, Marc Geilen, Twan ...
151
Voted
ECCV
2010
Springer
15 years 9 months ago
A Stochastic Graph Evolution Framework for Robust Multi-Target Tracking
Maintaining the stability of tracks on multiple targets in video over extended time periods remains a challenging problem. A few methods which have recently shown encouraging resul...
SDM
2007
SIAM
126views Data Mining» more  SDM 2007»
15 years 5 months ago
Scalable Name Disambiguation using Multi-level Graph Partition
When non-unique values are used as the identifier of entities, due to their homonym, confusion can occur. In particular, when (part of) “names” of entities are used as their ...
Byung-Won On, Dongwon Lee
DBSEC
2009
122views Database» more  DBSEC 2009»
15 years 5 months ago
An Approach to Security Policy Configuration Using Semantic Threat Graphs
Managing the configuration of heterogeneous enterprise security mechanisms is a wholly complex task. The effectiveness of a configuration may be constrained by poor understanding a...
Simon N. Foley, William M. Fitzgerald
IPL
2008
89views more  IPL 2008»
15 years 4 months ago
On the tractability of coloring semirandom graphs
As part of the efforts put in understanding the intricacies of the k-colorability problem, different distributions over k-colorable graphs were analyzed. While the problem is notor...
Julia Böttcher, Dan Vilenchik