Sciweavers

844 search results - page 73 / 169
» Solving the p
Sort
View
CPM
2009
Springer
94views Combinatorics» more  CPM 2009»
16 years 3 days ago
Online Approximate Matching with Non-local Distances
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
Raphaël Clifford, Benjamin Sach
ICMCS
2006
IEEE
138views Multimedia» more  ICMCS 2006»
15 years 11 months ago
Detecting Malicious Hosts in the Presence of Lying Hosts in Peer-to-Peer Streaming
Current peer-to-peer (P2P) streaming systems often assume that hosts are cooperative. However, this may not be true in the open environment of the Internet. In this paper, we disc...
Xing Jin, S.-H. Gary Chan, Wai-Pun Ken Yiu, Yongqi...
IPPS
2006
IEEE
15 years 11 months ago
D1HT: a distributed one hop hash table
Distributed Hash Tables (DHTs) have been used in a variety of applications, but most DHTs so far have opted to solve lookups with multiple hops, which sacrifices performance in o...
Luiz Rodolpho Monnerat, Cláudio L. Amorim
SCESM
2006
ACM
257views Algorithms» more  SCESM 2006»
15 years 11 months ago
Test ready UML statechart models
The dynamic behavior of systems is best described by Finite-state machines. Generation of executable tests from behavioral models such as UML Statecharts offers benefits such as s...
P. V. R. Murthy, P. C. Anitha, M. Mahesh, Rajesh S...
132
Voted
COLCOM
2005
IEEE
15 years 11 months ago
Scheduling algorithms for peer-to-peer collaborative file distribution
—Peer-to-Peer file sharing applications in the Internet, such as BitTorrent, Gnutella, etc., have been immensely popular. Prior research mainly focuses on peer and content discov...
Jonathan S. K. Chan, Victor O. K. Li, King-Shan Lu...