Sciweavers

3396 search results - page 603 / 680
» Tree representations of graphs
Sort
View
TSMC
2010
14 years 11 months ago
Automated Modeling of Dynamic Reliability Block Diagrams Using Colored Petri Nets
Computer system reliability is conventionally modeled and analyzed using techniques such as fault tree analysis (FTA) and reliability block diagrams (RBD), which provide static rep...
Ryan Robidoux, Haiping Xu, Liudong Xing, MengChu Z...
ACL
2011
14 years 8 months ago
Event Extraction as Dependency Parsing
Nested event structures are a common occurrence in both open domain and domain specific extraction tasks, e.g., a “crime” event can cause a “investigation” event, which c...
David McClosky, Mihai Surdeanu, Christopher D. Man...
PPOPP
2011
ACM
14 years 7 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
ECCV
2008
Springer
16 years 2 months ago
Window Annealing over Square Lattice Markov Random Field
Monte Carlo methods and their subsequent simulated annealing are able to minimize general energy functions. However, the slow convergence of simulated annealing compared with more ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
COCOON
2009
Springer
15 years 11 months ago
Convex Recoloring Revisited: Complexity and Exact Algorithms
We take a new look at the convex path recoloring (CPR), convex tree recoloring (CTR), and convex leaf recoloring (CLR) problems through the eyes of the independent set problem. Th...
Iyad A. Kanj, Dieter Kratsch