Sciweavers

3268 search results - page 578 / 654
» The hub number of a graph
Sort
View
CIKM
2008
Springer
15 years 1 months ago
Classifying networked entities with modularity kernels
Statistical machine learning techniques for data classification usually assume that all entities are i.i.d. (independent and identically distributed). However, real-world entities...
Dell Zhang, Robert Mao
IWCMC
2010
ACM
15 years 1 months ago
A flow trace generator using graph-based traffic classification techniques
We propose a novel methodology to generate realistic network flow traces to enable systematic evaluation of network monitoring systems in various traffic conditions. Our technique...
Peter Siska, Marc Ph. Stoecklin, Andreas Kind, Tor...
COLT
2008
Springer
15 years 1 months ago
When Random Play is Optimal Against an Adversary
We analyze a sequential game between a Gambler and a Casino. The Gambler allocates bets from a limited budget over a fixed menu of gambling events that are offered at equal time i...
Jacob Abernethy, Manfred K. Warmuth, Joel Yellin
CP
2008
Springer
15 years 1 months ago
Exploiting Common Subexpressions in Numerical CSPs
It is acknowledged that the symbolic form of the equations is crucial for interval-based solving techniques to efficiently handle systems of equations over the reals. However, only...
Ignacio Araya, Bertrand Neveu, Gilles Trombettoni
DIALM
2008
ACM
135views Algorithms» more  DIALM 2008»
15 years 1 months ago
Symmetric range assignment with disjoint MST constraints
If V is a set of n points in the unit square [0, 1]2 , and if R : V + is an assignment of positive real numbers (radii) to to those points, define a graph G(R) as follows: {v, w}...
Eric Schmutz