Sciweavers

4112 search results - page 770 / 823
» Efficient Algorithms for the Spoonerism Problem
Sort
View
MM
2005
ACM
140views Multimedia» more  MM 2005»
15 years 9 months ago
Web image clustering by consistent utilization of visual features and surrounding texts
Image clustering, an important technology for image processing, has been actively researched for a long period of time. Especially in recent years, with the explosive growth of th...
Bin Gao, Tie-Yan Liu, Tao Qin, Xin Zheng, QianShen...
CASES
2007
ACM
15 years 8 months ago
Eliminating inter-process cache interference through cache reconfigurability for real-time and low-power embedded multi-tasking
We propose a technique which leverages configurable data caches to address the problem of cache interference in multitasking embedded systems. Data caches are often necessary to p...
Rakesh Reddy, Peter Petrov
FUN
2010
Springer
230views Algorithms» more  FUN 2010»
15 years 7 months ago
Scheduling with Bully Selfish Jobs
In job scheduling with precedence constraints, i j means that job j cannot start being processed before job i is completed. In this paper we consider selfish bully jobs who do no...
Tami Tamir
CCS
2008
ACM
15 years 6 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
128
Voted
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 5 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets