283 search results - page 28 / 57 » Deterministic Polynomial Time Algorithms for Matrix Completi... |
IANDC
2007
13 years 7 months ago
2007
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...
IPL
2008
13 years 7 months ago
2008
We study the complexity of the membership or parsing problem for pictures generated by a family of picture grammars: Siromoney's Context-Free Kolam Array grammars (coincident...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In recent years, probabilistic analyses of algorithms have received increasing attention. Despite results on the average-case complexity and smoothed complexity of exact ...
SIROCCO
2008
13 years 9 months ago
2008
We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between t...
AAAI
2006
13 years 9 months ago
2006
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...