Sciweavers

11949 search results - page 2297 / 2390
» Some results on (a:b)-choosability
Sort
View
CC
2007
Springer
121views System Software» more  CC 2007»
15 years 1 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
IJNSEC
2008
124views more  IJNSEC 2008»
15 years 1 months ago
Scalable Delay-constrained Multicast Group Key Management
In the last few years, multicasting is increasingly used as an efficient communication mechanism for group-oriented applications in the Internet. Some multicast applications requi...
Said Gharout, Yacine Challal, Abdelmadjid Bouabdal...
IANDC
2006
77views more  IANDC 2006»
15 years 1 months ago
Lower and upper bounds on obtaining history independence
Abstract. History independent data structures, presented by Micciancio, are data structures that possess a strong security property: even if an intruder manages to get a copy of th...
Niv Buchbinder, Erez Petrank
CMPB
2007
113views more  CMPB 2007»
15 years 1 months ago
Paternity analysis in Excel
Paternity analysis using microsatellite information is a well studied subject. These markers are ideal for parentage studies and fingerprinting, due to their high discrimination ...
Margarida Rocheta, F. Miguel Dionísio, Lu&i...
IPM
2008
141views more  IPM 2008»
15 years 1 months ago
Towards a unified approach to document similarity search using manifold-ranking of blocks
Document similarity search (i.e. query by example) aims to retrieve a ranked list of documents similar to a query document in a text corpus or on the Web. Most existing approaches...
Xiaojun Wan, Jianwu Yang, Jianguo Xiao
« Prev « First page 2297 / 2390 Last » Next »