2080 search results - page 345 / 416 » Measuring empirical computational complexity |
165
click to vote
PADS
2004
ACM
15 years 11 months ago
2004
ACM
Computer simulation is the most common approach to studying wireless ad-hoc routing algorithms. The results, however, are only as good as the models the simulation uses. One shoul...
127
click to vote
CVPR
1996
IEEE
15 years 10 months ago
1996
IEEE
The Saliency Network proposed by Shashua and Ullman (1988) is a well-known approach to the problem of extracting salient curves from images while performing gap completion. This pa...
196
click to vote
ACST
2006
15 years 7 months ago
2006
Pattern discovery in DNA sequences is one of the most challenging tasks in molecular biology and computer science. The main goal of pattern discovery in DNA sequences is to identi...
160
click to vote
SIGCOMM
2009
ACM
16 years 21 days ago
2009
ACM
Business and economic considerations are driving the extensive use of service differentiation in Virtual Private Networks (VPNs) operated for business enterprises today. The resul...
141
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Glycobiology pertains to the study of carbohydrate sugar chains, or glycans, in a particular cell or organism. Many computational approaches have been proposed for ana...