Sciweavers

1612 search results - page 310 / 323
» Analysing Randomized Distributed Algorithms
Sort
View
ICDCS
2009
IEEE
13 years 5 months ago
Selective Protection: A Cost-Efficient Backup Scheme for Link State Routing
In recent years, there are substantial demands to reduce packet loss in the Internet. Among the schemes proposed, finding backup paths in advance is considered to be an effective ...
Meijia Hou, Dan Wang, Mingwei Xu, Jiahai Yang
ICIP
2002
IEEE
14 years 9 months ago
Efficient video similarity measurement with video signature
The proliferation of video content on the web makes similarity detection an indispensable tool in web data management, searching, and navigation. In this paper, we propose a numbe...
Sen-Ching S. Cheung, Avideh Zakhor
ICDE
2003
IEEE
157views Database» more  ICDE 2003»
14 years 8 months ago
Profile-Driven Cache Management
Modern distributed information systems cope with disconnection and limited bandwidth by using caches. In communicationconstrained situations, traditional demand-driven approaches ...
Mitch Cherniack, Eduardo F. Galvez, Michael J. Fra...
KDD
2008
ACM
137views Data Mining» more  KDD 2008»
14 years 7 months ago
Learning classifiers from only positive and unlabeled data
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
Charles Elkan, Keith Noto
RECOMB
2004
Springer
14 years 7 months ago
The evolutionary capacity of protein structures
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...
Leonid Meyerguz, David Kempe, Jon M. Kleinberg, Ro...