Sciweavers

3818 search results - page 103 / 764
» Word Problems on Compressed Words
Sort
View
SIAMNUM
2010
108views more  SIAMNUM 2010»
14 years 11 months ago
Shear Locking in a Plane Elasticity Problem and the Enhanced Assumed Strain Method
The method of enhanced assumed strains (EAS) is a popular tool for avoiding locking phenomena, e.g., a remedy for shear locking in plane elasticity. We consider bending-dominated p...
Dietrich Braess, Pingbing Ming, Zhongci Shi
EPIA
2009
Springer
15 years 11 months ago
Relieving Polysemy Problem for Synonymy Detection
In order to automatically identify noun synonyms, we propose a new idea which opposes classical polysemous representations of words to monosemous representations based on the “on...
Gaël Dias, Rumen Moraliyski
IJCGA
2006
85views more  IJCGA 2006»
15 years 4 months ago
Some Lower Bounds on Geometric Separability Problems
We obtain lower bounds in the algebraic computation tree model for deciding the separability of two disjoint point sets. In particular, we show (n log n) time lower bounds for sep...
Esther M. Arkin, Ferran Hurtado, Joseph S. B. Mitc...
IPL
2007
130views more  IPL 2007»
15 years 4 months ago
Linear structure of bipartite permutation graphs and the longest path problem
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipartite graphs and permutation graphs. A complete bipartite decomposition of a bip...
Ryuhei Uehara, Gabriel Valiente
125
Voted
ORL
2007
61views more  ORL 2007»
15 years 4 months ago
Exact solutions to linear programming problems
The use of floating-point calculations limits the accuracy of solutions obtained by standard LP software. We present a simplex-based algorithm that returns exact rational solutio...
David Applegate, William J. Cook, Sanjeeb Dash, Da...