Sciweavers

3818 search results - page 431 / 764
» Word Problems on Compressed Words
Sort
View
GRAMMARS
2002
119views more  GRAMMARS 2002»
15 years 6 months ago
Computational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
Khalil Sima'an
SIAMAM
2000
74views more  SIAMAM 2000»
15 years 6 months ago
Modeling Injection Molding Processes with Deformable Porous Preforms
This paper deduces a new model aimed at simulating injection molding processes under isothermal conditions. These processes can be generally stated as infiltration problems in init...
D. Ambrosi, Luigi Preziosi
SIAMCOMP
2000
74views more  SIAMCOMP 2000»
15 years 6 months ago
On Quiescent Reliable Communication
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process cra...
Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg
SIAMJO
2000
74views more  SIAMJO 2000»
15 years 6 months ago
A Specialized Interior-Point Algorithm for Multicommodity Network Flows
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
Jordi Castro
JMMA
2002
90views more  JMMA 2002»
15 years 6 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...