106 search results - page 12 / 22 » Two Element Unavoidable Sets of Partial Words |
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
CVPR
2001
IEEE
14 years 10 months ago
2001
IEEE
We extend a recently developed method [1] for learning the semantics of image databases using text and pictures. We incorporate statistical natural language processing in order to...
FUIN
2007
13 years 8 months ago
2007
Abstract. In the paper two notions related to local (distributed) computations are identified and discussed. The first one is the notion of reducible graphs. A graph is reducible...
JUCS
2010
13 years 3 months ago
2010
: Although a database view embodies partial information about the state of the main schema, the state of the view schema is a quotient (and not a subset) of the state of the main s...
RECOMB
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. Hierarchical clustering is a popular method for grouping together similar elements based on a distance measure between them. In many cases, annotation information for som...