Sciweavers

27692 search results - page 104 / 5539
» Where is ...
Sort
View
COLING
2002
13 years 8 months ago
Machine Translation by Interaction between Paraphraser and Transfer
A machine translation model has been proposed where an input is translated through both source-language and target-language paraphrasing processes. We have implemented our prototy...
Kazuhide Yamamoto
ENDM
2002
107views more  ENDM 2002»
13 years 8 months ago
Edge-Colorings of Complete Graphs that Avoid Polychromatic Trees
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...
Tao Jiang, Douglas B. West
FUIN
2002
117views more  FUIN 2002»
13 years 8 months ago
A Comparative Study of Some Generalized Rough Approximations
In this paper we focus upon a comparison of some generalized rough approximations of sets, where the classical indiscernibility relation is generalized to any binary reflexive rela...
Anna Gomolinska
MOC
1998
131views more  MOC 1998»
13 years 8 months ago
An algorithm for evaluation of discrete logarithms in some nonprime finite fields
In this paper we propose an algorithm for evaluation of logarithms in the finite fields Fpn , where the number pn − 1 has a small primitive factor r. The heuristic estimate of ...
Igor A. Semaev
SIAMDM
2002
85views more  SIAMDM 2002»
13 years 8 months ago
Finding a 2-Core of a Tree in Linear Time
Let T be an edge-weighted tree. A p-core of T is a set of p mutually disjoint paths in T that minimizes the sum of the distances of all vertices in T from any of the p paths, where...
Biing-Feng Wang