1322 search results - page 54 / 265 » Parameterized counting problems |
115
Voted
INLG
2010
Springer
15 years 15 days ago
2010
Springer
The problem of Named Entity Generation is expressed as a conditional probability model over a structured domain. By defining a factor-graph model over the mentions of a text, we o...
134
Voted
ICPP
1999
IEEE
15 years 6 months ago
1999
IEEE
Task graph scheduling has been found effective in performance prediction and optimization of parallel applications. A number of static scheduling algorithms have been proposed for...
107
Voted
CG
2002
Springer
15 years 2 months ago
2002
Springer
Parameterization of a 3D triangular mesh is a fundamental problem in various applications of meshes. The convex combination approach is widely used for parameterization because of...
216
Voted
ICDT
2009
ACM
16 years 3 months ago
2009
ACM
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
124
Voted
COMBINATORICS
2004
15 years 2 months ago
2004
Erdos posed the problem of how many random subsets need to be chosen from a set of n elements, each element appearing in each subset with probability p = 1/2, in order that at lea...