Sciweavers

4781 search results - page 595 / 957
» Online algorithms for network design
Sort
View
CCCG
2007
15 years 8 months ago
Terminal Steiner Tree with Bounded Edge Length
In this paper, we study a Steiner tree related problem called “Terminal Steiner Tree with Bounded Edge Length”: given a set of terminal points P in a plane, one is asked to ...
Zhiyong Lin
SODA
2008
ACM
96views Algorithms» more  SODA 2008»
15 years 8 months ago
Unconditionally reliable message transmission in directed networks
In the unconditionally reliable message transmission (URMT) problem, two non-faulty players, the sender S and the receiver R are part of a synchronous network modeled as a directe...
Bhavani Shankar, Prasant Gopal, Kannan Srinathan, ...
NOSSDAV
2009
Springer
16 years 1 months ago
Dynamic overlay multicast in 3D video collaborative systems
Multi-stream/multi-site 3D video collaborative systems are promising as they enable remote users to interact in a 3D virtual space with a sense of co-presence. However, the decent...
Wanmin Wu, Zhenyu Yang, Klara Nahrstedt
175
Voted
AINA
2010
IEEE
15 years 11 months ago
The Cost Effective Pre-processing Based NFA Pattern Matching Architecture for NIDS
—Network Intrusion Detection System (NIDS) is a system which can detect network attacks resulted from worms and viruses on the Internet. An efficient pattern matching algorithm p...
Yeim-Kuan Chang, Chen-Rong Chang, Cheng-Chien Su
IJON
2007
83views more  IJON 2007»
15 years 6 months ago
Neurospaces: Towards automated model partitioning for parallel computers
Parallel computers have the computing power needed to simulate biologically accurate neuronal network models. Partitioning is the process of cutting a model in pieces and assignin...
Hugo Cornelis, Erik De Schutter