Sciweavers

4208 search results - page 617 / 842
» Challenges in Evaluating Distributed Algorithms
Sort
View
AAAI
2000
15 years 3 months ago
Generating Satisfiable Problem Instances
A major difficulty in evaluating incomplete local search style algorithms for constraint satisfaction problems is the need for a source of hard problem instances that are guarante...
Dimitris Achlioptas, Carla P. Gomes, Henry A. Kaut...
106
Voted
CN
2007
80views more  CN 2007»
15 years 1 months ago
A queueing analysis for the denial of service (DoS) attacks in computer networks
In most network security analysis, researchers mainly focus on qualitative studies on security schemes and possible attacks, and there are few papers on quantitative analysis in t...
Yang Wang, Chuang Lin, Quan-Lin Li, Yuguang Fang
PAMI
2010
184views more  PAMI 2010»
15 years 8 days ago
Accurate Image Search Using the Contextual Dissimilarity Measure
— This paper introduces the contextual dissimilarity measure which significantly improves the accuracy of bag-offeatures based image search. Our measure takes into account the l...
Herve Jegou, Cordelia Schmid, Hedi Harzallah, Jako...
TIT
2010
144views Education» more  TIT 2010»
14 years 8 months ago
Generalized and doubly generalized LDPC codes with random component codes for the binary erasure channel
In this paper, a method for the asymptotic analysis of generalized low-density parity-check (GLDPC) codes and doubly generalized low-density parity-check (D-GLDPC) codes over the b...
Enrico Paolini, Marc P. C. Fossorier, Marco Chiani
MOBIHOC
2008
ACM
16 years 1 months ago
An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model
Dealing with interference is one of the primary challenges to solve in the design of protocols for wireless ad-hoc networks. Most of the work in the literature assumes localized o...
Christian Scheideler, Andréa W. Richa, Paol...