Sciweavers

1793 search results - page 279 / 359
» On the Design of Codes for DNA Computing
Sort
View
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
15 years 10 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
NOSSDAV
2010
Springer
15 years 10 months ago
Mesh-based peer-to-peer layered video streaming with taxation
Recent advance in scalable video coding (SVC) makes it possible for users to receive the same video with different qualities. To adopt SVC in P2P streaming, two key design questio...
Hao Hu, Yang Guo, Yong Liu
WWW
2007
ACM
16 years 7 months ago
Is high-quality vod feasible using P2P swarming?
Peer-to-peer technologies are increasingly becoming the medium of choice for delivering media content, both professional and homegrown, to large user populations. Indeed, current ...
Siddhartha Annapureddy, Saikat Guha, Christos Gkan...
CVPR
2005
IEEE
16 years 8 months ago
Hierarchical Part-Based Visual Object Categorization
We propose a generative model that codes the geometry and appearance of generic visual object categories as a loose hierarchy of parts, with probabilistic spatial relations linkin...
Guillaume Bouchard, Bill Triggs
ICPR
2002
IEEE
16 years 7 months ago
Feature Selection for Pose Invariant Face Recognition
One of the major difficulties in face recognition systems is the in-depth pose variation problem. Most face recognition approaches assume that the pose of the face is known. In th...
Berk Gökberk, Ethem Alpaydin, Lale Akarun