Sciweavers

860 search results - page 146 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
IACR
2011
87views more  IACR 2011»
12 years 7 months ago
Is privacy compatible with truthfulness?
In the area of privacy-preserving data mining, a differentially private mechanism intuitively encourages people to share their data truthfully because they are at little risk of ...
David Xiao
WWW
2003
ACM
14 years 8 months ago
Efficient URL caching for world wide web crawling
Crawling the web is deceptively simple: the basic algorithm is (a) Fetch a page (b) Parse it to extract all linked URLs (c) For all the URLs not seen before, repeat (a)?(c). Howev...
Andrei Z. Broder, Marc Najork, Janet L. Wiener
IWMM
2009
Springer
164views Hardware» more  IWMM 2009»
14 years 2 months ago
Live heap space analysis for languages with garbage collection
The peak heap consumption of a program is the maximum size of the live data on the heap during the execution of the program, i.e., the minimum amount of heap space needed to run t...
Elvira Albert, Samir Genaim, Miguel Gómez-Z...
EMSOFT
2004
Springer
14 years 1 months ago
Scheduling within temporal partitions: response-time analysis and server design
As the bandwidth of CPUs and networks continues to grow, it becomes more attractive, for efficiency reasons, to share such resources among several applications with the minimum le...
Luís Almeida, Paulo Pedreiras
ICDCS
2010
IEEE
13 years 11 months ago
Adaptive Jamming-Resistant Broadcast Systems with Partial Channel Sharing
—Wireless communication is particularly vulnerable to signal jamming attacks. Spread spectrum mitigates such problem by spreading normal narrowband signals over a much wider band...
Qi Dong, Donggang Liu