Sciweavers

1760 search results - page 112 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
CN
2006
74views more  CN 2006»
13 years 8 months ago
OMNI: An efficient overlay multicast infrastructure for real-time applications
We consider an overlay architecture (called OMNI) where service providers deploy a set of service nodes (called MSNs) in the network to efficiently implement media-streaming appli...
Suman Banerjee, Christopher Kommareddy, Koushik Ka...
SIGCSE
2002
ACM
211views Education» more  SIGCSE 2002»
13 years 8 months ago
To java.net and beyond: teaching networking concepts using the Java networking API
This paper covers the use of Java and its API for developing networking programs in an undergraduate computer networks class. Through the use of TCP and UDP sockets provided in th...
Greg Gagne
ENTCS
2006
136views more  ENTCS 2006»
13 years 8 months ago
Adaptive Application of SAT Solving Techniques
New heuristics and strategies have enabled major advancements in SAT solving in recent years. However, experimentation has shown that there is no winning solution that works in al...
Ohad Shacham, Karen Yorav
JCP
2008
121views more  JCP 2008»
13 years 8 months ago
Relation Organization of SOM Initial Map by Improved Node Exchange
The Self Organizing Map (SOM) involves neural networks, that learns the features of input data thorough unsupervised, competitive neighborhood learning. In the SOM learning algorit...
Tsutomu Miyoshi
COMGEO
2010
ACM
13 years 8 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount