53 search results - page 8 / 11 » Average-Case Complexity of Shellsort |
IJAC
2008
13 years 11 months ago
2008
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertic...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
In this paper, we study the average case complexity of the Unique Games problem. We propose a natural semi-random model, in which a unique game instance is generated in several st...
ICDE
2011
IEEE
13 years 2 months ago
2011
IEEE
— Real-world databases often have extremely complex schemas. With thousands of entity types and relationships, each with a hundred or so attributes, it is extremely difficult fo...
NIPS
2007
14 years 8 days ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
INFOCOM
2009
IEEE
14 years 5 months ago
2009
IEEE
—The emerging wireless relay networks (WRNs) are expected to provide significant improvement on throughput and extension of coverage area for next-generation wireless systems. W...