Sciweavers

3096 search results - page 126 / 620
» Theory and Use of the EM Algorithm
Sort
View
COLING
1994
15 years 6 months ago
Two Parsing Algorithms by Means of Finite State Transducers
We present a new apl)roach , ilhlstrated by two algorithms> for parsing not only Finite SI.ate (:Iranlnlars but also Context Free Grainlnars and their extension, by means of fi...
Emmanuel Roche
SAGT
2010
Springer
200views Game Theory» more  SAGT 2010»
15 years 3 months ago
2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that...
Vijay V. Vazirani
ADBIS
2000
Springer
188views Database» more  ADBIS 2000»
15 years 9 months ago
Algorithms for Rewriting Aggregate Queries Using Views
Queries involving aggregation are typical in a number of database research areas, such as data warehousing, global information systems and mobile computing. One of the main ideas ...
Sara Cohen, Werner Nutt, Alexander Serebrenik
JCDL
2006
ACM
71views Education» more  JCDL 2006»
15 years 10 months ago
Using controlled query generation to evaluate blind relevance feedback algorithms
Currently in document retrieval there are many algorithms each with different strengths and weakness. There is some difficulty, however, in evaluating the impact of the test quer...
Chris Jordan, Carolyn R. Watters, Qigang Gao
RSA
2002
99views more  RSA 2002»
15 years 4 months ago
Distributed algorithms with dynamical random transitions
Given any measure-preserving dynamical system (Y, A , , T) and g Lp() , we study convergence of the sequence 1 n n k=1 g TSk , n 1 where Sk is a dynamic Zr -valued random w...
Nadine Guillotin-Plantard, René Schott