Sciweavers

575 search results - page 54 / 115
» A Note on Karr's Algorithm
Sort
View
FOCS
2003
IEEE
15 years 4 months ago
Switch Scheduling via Randomized Edge Coloring
The essence of an Internet router is an n ¡ n switch which routes packets from input to output ports. Such a switch can be viewed as a bipartite graph with the input and output p...
Gagan Aggarwal, Rajeev Motwani, Devavrat Shah, An ...
ESA
2006
Springer
77views Algorithms» more  ESA 2006»
15 years 2 months ago
Negative Examples for Sequential Importance Sampling of Binary Contingency Tables
The sequential importance sampling (SIS) algorithm has gained considerable popularity for its empirical success. One of its noted applications is to the binary contingency tables p...
Ivona Bezáková, Alistair Sinclair, D...
ICIP
2004
IEEE
16 years 24 days ago
Rotation and cropping resilient data hiding with zernike moments
Most digital data hiding schemes are sensitive to simple geometric attacks namely rotation, cropping, and scaling. Of these, rotational attacks possess the capability to not only ...
Palak K. Amin, Koduvayur P. Subbalakshmi
69
Voted
FOCS
2003
IEEE
15 years 4 months ago
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices
Suffix trees and suffix arrays are the most prominent full-text indices, and their construction algorithms are well studied. In the literature, the fastest algorithm runs in O(n...
Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung
COCO
2000
Springer
112views Algorithms» more  COCO 2000»
15 years 3 months ago
Combinatorial Interpretation of Kolmogorov Complexity
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
Andrei E. Romashchenko, Alexander Shen, Nikolai K....