Sciweavers

6456 search results - page 430 / 1292
» Constraint Solving on Terms
Sort
View
IANDC
2007
117views more  IANDC 2007»
15 years 6 months ago
Computing the edit distance of a regular language
The edit distance (or Levenshtein distance) between two words is the smallest number of substitutions, insertions, and deletions of symbols that can be used to transform one of the...
Stavros Konstantinidis
PAMI
2006
122views more  PAMI 2006»
15 years 6 months ago
Polarimetric Image Segmentation via Maximum-Likelihood Approximation and Efficient Multiphase Level-Sets
This study investigates a level set method for complex polarimetric image segmentation. It consists of minimizing a functional containing an original observation term derived from ...
Ismail Ben Ayed, Amar Mitiche, Ziad Belhadj
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Mechanism design over discrete domains
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
Ahuva Mu'alem, Michael Schapira
MOR
2002
60views more  MOR 2002»
15 years 6 months ago
Properties of the Log-Barrier Function on Degenerate Nonlinear Programs
We examine the sequence of local minimizers of the log-barrier function for a nonlinear program near a solution at which second-order sufficient conditions and the Mangasarian-From...
Stephen J. Wright, Dominique Orban
SQJ
2010
112views more  SQJ 2010»
15 years 1 months ago
Improving design-pattern identification: a new approach and an exploratory study
The identification of occurrences of design patterns in programs can help maintainers to understand the program design and implementation. It can also help them to make informed ch...
Yann-Gaël Guéhéneuc, Jean-Yves ...