3415 search results - page 279 / 683 » Lower bounds on kernelization |
181
click to vote
BROADNETS
2005
IEEE
16 years 10 days ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
181
Voted
ISAAC
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. In this paper, the space requirements for the OBDD representation of certain graph classes, specifically cographs, several types of graphs with few P4s, unit interval gr...
149
click to vote
COLT
2004
Springer
16 years 3 days ago
2004
Springer
We give the first polynomial time prediction strategy for any PAC-learnable class C that probabilistically predicts the target with mistake probability poly(log(t)) t = ˜O 1 t w...
148
click to vote
ISIPTA
2003
IEEE
15 years 12 months ago
2003
IEEE
abstract DAMJAN ˇSKULJ University of Ljubljana, Slovenia A new approach to define a product of capacities is presented. It works for capacities that are in a certain relation wi...
181
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...