Sciweavers

16430 search results - page 528 / 3286
» On Computable Tree Functions
Sort
View
MUE
2009
IEEE
252views Multimedia» more  MUE 2009»
16 years 1 months ago
DDoS Detection and Traceback with Decision Tree and Grey Relational Analysis
As modern life becomes increasingly closely bound to the Internet, network security becomes increasingly important. Like it or not, we all live under the shadow of network threats...
Yi-Chi Wu, Huei-Ru Tseng, Wuu Yang, Rong-Hong Jan
CSL
2009
Springer
15 years 11 months ago
Tree-Width for First Order Formulae
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
Isolde Adler, Mark Weyer
NETWORKING
2010
15 years 8 months ago
Cost Bounds of Multicast Light-Trees in WDM Networks
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...
Fen Zhou, Miklós Molnár, Bernard Cou...
ICPR
2004
IEEE
16 years 8 months ago
Multiresolution Spatial Partitioning for Shape Representation
In this paper, an original solution for shape representation is proposed which relies on a spatial partitioning approach. The representation selects a discrete set of reference po...
Stefano Berretti, Alberto Del Bimbo
DLT
2003
15 years 8 months ago
Complexity Theory Made Easy
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
Heribert Vollmer