Sciweavers

1059 search results - page 155 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
IPPS
2009
IEEE
14 years 3 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
ICMCS
2008
IEEE
143views Multimedia» more  ICMCS 2008»
14 years 3 months ago
Music fingerprint extraction for classical music cover song identification
An algorithm for extracting music fingerprints directly from an audio signal is proposed in this paper. The proposed music fingerprint aims to encapsulate various aspects of mus...
Samuel Kim, Erdem Unal, Shrikanth Narayanan
GCC
2005
Springer
14 years 2 months ago
A Routing Protocol Based on Trust for MANETs
Abstract. Ad hoc network is a peer-to-peer grid system. The combination of the Knowledge Grid and ad hoc network could have a great effect on the future interconnection environment...
Cuirong Wang, Xiaozong Yang, Yuan Gao
STOC
2003
ACM
142views Algorithms» more  STOC 2003»
14 years 9 months ago
Optimal probabilistic fingerprint codes
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
Gábor Tardos
ALENEX
2001
105views Algorithms» more  ALENEX 2001»
13 years 10 months ago
A Probabilistic Spell for the Curse of Dimensionality
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
Edgar Chávez, Gonzalo Navarro