Sciweavers

796 search results - page 124 / 160
» The Anonymous Subgraph Problem
Sort
View
ECRTS
2009
IEEE
14 years 9 months ago
Precise Worst-Case Execution Time Analysis for Processors with Timing Anomalies
This paper explores timing anomalies in WCET analysis. Timing anomalies add to the complexity of WCET analysis and make it hard to apply divide-and-conquer strategies to simplify ...
Raimund Kirner, Albrecht Kadlec, Peter P. Puschner
ICMLA
2009
14 years 9 months ago
Exact Graph Structure Estimation with Degree Priors
We describe a generative model for graph edges under specific degree distributions which admits an exact and efficient inference method for recovering the most likely structure. T...
Bert Huang, Tony Jebara
SIAMJO
2010
87views more  SIAMJO 2010»
14 years 6 months ago
Universal Rigidity and Edge Sparsification for Sensor Network Localization
Owing to their high accuracy and ease of formulation, there has been great interest in applying convex optimization techniques, particularly that of semidefinite programming (SDP)...
Zhisu Zhu, Anthony Man-Cho So, Yinyu Ye
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
14 years 3 months ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
DMGT
2011
94views more  DMGT 2011»
14 years 3 months ago
Closed k-stop distance in graphs
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
Grady Bullington, Linda Eroh, Ralucca Gera, Steven...