1356 search results - page 11 / 272 » Some New Results on Inverse Sorting Problems |
SODA
2003
ACM
13 years 8 months ago
2003
ACM
In a recent paper, Ajtai et al. [1] give a streaming algorithm to count the number of inversions in a stream Ä ¾ Ñ Ò using two passes and Ç´¯ ½ ÔÒÐÓ Ò´ÐÓ Ñ·ÐÓ...
GECCO
2004
Springer
14 years 26 days ago
2004
Springer
Most problems studied in artificial intelligence possess some form of structure, but a precise way to define such structure is so far lacking. We investigate how the notion of pr...
TCS
2011
13 years 2 months ago
2011
We formulate and study a new computational model for dynamic data. In this model, the data changes gradually and the goal of an algorithm is to compute the solution to some proble...
DAM
2006
13 years 7 months ago
2006
The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...
VLDB
1997
ACM
13 years 11 months ago
1997
ACM
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...