Sciweavers

2365 search results - page 104 / 473
» All things are connected
Sort
View
FOCS
1999
IEEE
15 years 5 months ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl
SP
1997
IEEE
135views Security Privacy» more  SP 1997»
15 years 5 months ago
Analysis of a Denial of Service Attack on TCP
This paper analyzes a network-baseddenial of service attack for IP (Internet Protocol) based networks. It is popularly called SYN flooding. It works by an attacker sending many T...
Christoph L. Schuba, Ivan Krsul, Markus G. Kuhn, E...
HT
2007
ACM
15 years 5 months ago
HSTP: hyperspeech transfer protocol
HTTP provides a mechanism to connect web sites. Almost all sites have a large amount of hypertext content that provides connection to other sites in the World Wide Web. The succes...
Sheetal K. Agarwal, Dipanjan Chakraborty, Arun Kum...
ACIVS
2006
Springer
15 years 5 months ago
Robust Analysis of Silhouettes by Morphological Size Distributions
We address the topic of real-time analysis and recognition of silhouettes. The method that we propose first produces object features obtained by a new type of morphological operato...
Olivier Barnich, Sébastien Jodogne, Marc Va...
CORR
2010
Springer
122views Education» more  CORR 2010»
15 years 1 months ago
How to meet asynchronously (almost) everywhere
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc