7129 search results - page 762 / 1426 » Approximation Algorithms for Treewidth |
197
Voted
SODA
2010
ACM
16 years 4 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 ...
162
click to vote
GLOBECOM
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we study the anonymous cardinality estimation problem in radio frequency identification (RFID) systems. To preserve privacy and anonymity, each tag only transmi...
181
click to vote
PKDD
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
161
Voted
ICDCS
2007
IEEE
16 years 1 months ago
2007
IEEE
Peer to peer (P2P) systems are moving from application specific architectures to a generic service oriented design philosophy. This raises interesting problems in connection with...
170
click to vote
DAWAK
2007
Springer
16 years 1 months ago
2007
Springer
Representative-based clustering algorithms are quite popular due to their relative high speed and because of their sound theoretical foundation. On the other hand, the clusters the...