Sciweavers

1094 search results - page 121 / 219
» One Size Fits All
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
14 years 1 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
DEBU
1998
95views more  DEBU 1998»
13 years 8 months ago
What can you do with a Web in your Pocket?
The amount of information available online has grown enormously over the past decade. Fortunately, computing power, disk capacity, and network bandwidth have also increased dramat...
Sergey Brin, Rajeev Motwani, Lawrence Page, Terry ...
CORR
2012
Springer
218views Education» more  CORR 2012»
12 years 4 months ago
Robust 1-bit compressed sensing and sparse logistic regression: A convex programming approach
This paper develops theoretical results regarding noisy 1-bit compressed sensing and sparse binomial regression. We demonstrate that a single convex program gives an accurate estim...
Yaniv Plan, Roman Vershynin
SIGMETRICS
2004
ACM
14 years 2 months ago
A mean-field analysis of short lived interacting TCP flows
In this paper, we consider a set of HTTP flows using TCP over a common drop-tail link to download files. After each download, a flow waits for a random think time before reques...
François Baccelli, Augustin Chaintreau, Dan...
PVM
1998
Springer
14 years 1 months ago
SKaMPI: A Detailed, Accurate MPI Benchmark
Abstract. SKaMPI is a benchmark for MPI implementations. Its purpose is the detailed analysis of the runtime of individual MPI operations and comparison of these for di erent imple...
Ralf Reussner, Peter Sanders, Lutz Prechelt, Matth...