Sciweavers

426 search results - page 28 / 86
» Run lengths and liquidity
Sort
View
100
Voted
ICDAR
2011
IEEE
13 years 9 months ago
Edge-Based Features for Localization of Artificial Urdu Text in Video Images
—Content-based video indexing and retrieval has become an interesting research area with the tremendous growth in the amount of digital media. In addition to the audio-visual con...
Akhtar Jamil, Imran Siddiqi, Fahim Arif, Ahsen Raz...
87
Voted
STOC
2003
ACM
153views Algorithms» more  STOC 2003»
15 years 10 months ago
Sublinear geometric algorithms
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
Bernard Chazelle, Ding Liu, Avner Magen
EUROCRYPT
2007
Springer
15 years 4 months ago
Cryptanalysis of the Sidelnikov Cryptosystem
We present a structural attack against the Sidelnikov cryptosystem [8]. The attack creates a private key from a given public key. Its running time is subexponential and is effecti...
Lorenz Minder, Amin Shokrollahi
86
Voted
ICCS
2005
Springer
15 years 3 months ago
Disjoint Segments with Maximum Density
Given a sequence A of numbers and two positive integers and k, we study the problem to find k disjoint segments of A, each has length at least , such that their sum of densities i...
Yen Hung Chen, Hsueh-I Lu, Chuan Yi Tang
78
Voted
SAT
2005
Springer
124views Hardware» more  SAT 2005»
15 years 3 months ago
An Improved Upper Bound for SAT
We give a randomized algorithm for testing satisfiability of Boolean formulas in conjunctive normal form with no restriction on clause length. Its running time is at most 2n(1−1...
Evgeny Dantsin, Alexander Wolpert