Sciweavers

14078 search results - page 2752 / 2816
» Design and Analysis of Computer Algorithms
Sort
View
PREMI
2005
Springer
15 years 8 months ago
Geometric Decision Rules for Instance-Based Learning Problems
In the typical nonparametric approach to classification in instance-based learning and data mining, random data (the training set of patterns) are collected and used to design a d...
Binay K. Bhattacharya, Kaustav Mukherjee, Godfried...
ICS
2005
Tsinghua U.
15 years 8 months ago
Continuous Replica Placement schemes in distributed systems
The Replica Placement Problem (RPP) aims at creating a set of duplicated data objects across the nodes of a distributed system in order to optimize certain criteria. Typically, RP...
Thanasis Loukopoulos, Petros Lampsas, Ishfaq Ahmad
MM
2004
ACM
97views Multimedia» more  MM 2004»
15 years 8 months ago
Security of human video objects by incorporating a chaos-based feedback cryptographic scheme
Security of multimedia files attracts more and more attention and many encryption methods have been proposed in literature. However most cryptographic systems deal with multimedia...
Paraskevi K. Tzouveli, Klimis S. Ntalianis, Stefan...
135
Voted
SIGCOMM
2004
ACM
15 years 8 months ago
The feasibility of supporting large-scale live streaming applications with dynamic application end-points
While application end-point architectures have proven to be viable solutions for large-scale distributed applications such as distributed computing and file-sharing, there is lit...
Kunwadee Sripanidkulchai, Aditya Ganjam, Bruce M. ...
SPAA
2004
ACM
15 years 8 months ago
Lower bounds for graph embeddings and combinatorial preconditioners
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
Gary L. Miller, Peter C. Richter
« Prev « First page 2752 / 2816 Last » Next »