Sciweavers

9842 search results - page 1419 / 1969
» Problem complexity
Sort
View
WWW
2009
ACM
16 years 7 months ago
Anycast-aware transport for content delivery networks
Anycast-based content delivery networks (CDNs) have many properties that make them ideal for the large scale distribution of content on the Internet. However, because routing chan...
Zakaria Al-Qudah, Seungjoon Lee, Michael Rabinovic...
CPM
1993
Springer
125views Combinatorics» more  CPM 1993»
15 years 11 months ago
Detecting False Matches in String Matching Algorithms
Consider a text string of length n, a pattern string of length m, and a match vector of length n which declares each location in the text to be either a mismatch (the pattern does ...
S. Muthukrishnan
IPSN
2010
Springer
15 years 11 months ago
Practical modeling and prediction of radio coverage of indoor sensor networks
The robust operation of many sensor network applications depends on deploying relays to ensure wireless coverage. Radio mapping aims to predict network coverage based on a small n...
Octav Chipara, Gregory Hackmann, Chenyang Lu, Will...
BCS
2008
15 years 8 months ago
Beatbox - A Computer Simulation Environment for Computational Biology of the Heart
Despite over a century's study, the trigger mechanisms of cardiac arrhythmias are poorly understood. Even modern experimental methods do not provide sufficient temporal and s...
Ross McFarlane, Irina V. Biktasheva
UAI
2004
15 years 8 months ago
Recovering Articulated Object Models from 3D Range Data
We address the problem of unsupervised learning of complex articulated object models from 3D range data. We describe an algorithm whose input is a set of meshes corresponding to d...
Dragomir Anguelov, Daphne Koller, Hoi-Cheung Pang,...
« Prev « First page 1419 / 1969 Last » Next »