Explain efficient algorithm for edge-labeled graph

Assignment Help Database Management System
Reference no: EM1368833

We can use dynamic programming on a directed graph G = (V, E) for speech recognition. Each edge (u, v)  E is labeled with a sound σ(u, v) from a finite set Σ of sounds. The labeled graph is a formal model of a person speaking a restricted language. Each path in the graph starting from a distinguished vertex v0  V corresponds to a possible sequence of sounds produced by the model. The label of a directed path is defined to be the concatenation of the labels of the edges on that path.

a. Describe an efficient algorithm that, given an edge-labeled graph G with distinguished vertex v0 and a sequence s = σ1, σ2, ..., σk of characters from Σ, returns a path in G that begins at v0 and has s as its label, if any such path exists. Otherwise, the algorithm should return NO-SUCH-PATH. Analyze the running time of your algorithm.

Now, suppose that every edge (u, v)  E has also been given an associated nonnegative probability p(u, v) of traversing the edge (u, v) from vertex u and thus producing the corresponding sound. The sum of the probabilities of the edges leaving any vertex equals 1. The probability of a path is defined to be the product of the probabilities of its edges. We can view the probability of a path beginning at v0 as the probability that a "random walk" beginning at v0 will follow the specified path, where the choice of which edge to take at a vertex u is made probabilistically according to the probabilities of the available edges leaving u.

b. Extend your answer to part (a) so that if a path is returned, it is a most probable path starting at v0 and having label s. Analyze the running time of your algorithm.

Reference no: EM1368833

Questions Cloud

Explain the carrier challenged reardon''s standing to sue : Explain The carrier challenged Reardon's standing (right) to sue claiming that the original contract said Reardon had no liability to pay for the merchandise until after it was received and sold by Reardon.
Discussion on merger consideration : With lower values for gasoline than a couple of years before will Americans start spending again? If they do, what will they spend the savings on Vacations?
What is sports car acceleration : A sports car moving at constant speed travels 90 m in 4.9s. If it then brakes and comes to a stop in 4s, what is its acceleration? Express the answer in terms of g's, where g = 9.80 m/s2. (Take the positive direction to be direction of travel.)
Show the components of an effective training program : Developing training, Needs Assessment and HR and what are the components of an effective training program?
Explain efficient algorithm for edge-labeled graph : Explain efficient algorithm that, provided edge-labeled graph G with distinguished vertex v0 and sequence s = σ1, σ2, ..., σk of characters from Σ, returns path in G which begins at v0.
Negotiation situation using different strategies : Describe a negotiation situation that employs different negotiation strategies and describe the negotiation processes
Make an aggregate demand and aggregate supply graph : The data given below shows the situation in 2010 and 2011 if Fed does not use the monetary policy,
What is the unit vector in the direction of block : A 0.6 kg block of ice is sliding by you on a very slippery floor at 3.5 m/s. As it goes by, you give it a kick perpendicular to its path. Your foot is in contact with ice block for 0.0035 seconds.
Explain how you would build rapport with your audience : Explain how you would build rapport with your audience in a business presentation and What motivational strategies have you used

Reviews

Write a Review

Database Management System Questions & Answers

  Baxter aviation database

ER diagram for the Baxter Aviation database

  Write three items contained in fat database

What does CHS stand for? List three items contained in the FAT database. List two features NTFS provides that FAT does not.

  Relational algebra expressions for names of salespeople

Illustrate relational algebra expressions for names of all salespeople, names of all salespeople having ORDER row and names of salespeople not having ORDER row.

  Write a recursive sql query

MCIS 630 Database Systems: -  Write a recursive SQL query that outputs the names of all subparts of the part with part-id “P- 100”.

  Design er schema to keep track of information of votes

Design an er schema for keeping track of information about votes taken in the U.S. House of Representatives during the current two year congressional session.

  Expressions in tuple relational calculus and domain relation

Consider the relational database described in Problem Give expressions in tuple relational calculus and domain relational calculus for each of the following queries: Find all the companies that have offices in all the cities in which company C2..

  Describe information using table

Describe the information seen, using the terms such as table, schema and key. Describe the EMPLOYEE and EMP_PHOTO tables in detail.

  Find bcnf decomposition of relation schema

Consider a relation schema r(A,B,C,D,E, F) and a set of functional dependencies {A BCD,BCDE,BD,DA}.  Determine whether or not (A,E, F) is in BCNF and justify your answer. If (A,E, F) is not in BCNF,find a BCNF decomposition of it.

  Creating database structure using sql

creating database structure using SQL

  Explain why data flow diagrams are developed in a hierarchy

Explain why data flow diagrams are developed in a hierarchy? What are the names of some levels in the hierarchy?

  Knowledge and data warehousing

Knowledge and Data Warehousing

  Access values through queries to databases

However, the only way you can access values is through queries to the databases. In single query, you can specify value k to one of two databases.

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd