Sciweavers

1458 search results - page 248 / 292
» Monads for incremental computing
Sort
View
CCR
2008
75views more  CCR 2008»
15 years 4 months ago
Removing exponential backoff from TCP
The well-accepted wisdom is that TCP's exponential backoff mechanism, introduced by Jacobson 20 years ago, is essential for preserving the stability of the Internet. In this ...
Amit Mondal, Aleksandar Kuzmanovic
DCG
2008
93views more  DCG 2008»
15 years 4 months ago
Robust Shape Fitting via Peeling and Grating Coresets
Let P be a set of n points in Rd . A subset S of P is called a (k, )-kernel if for every direction, the direction width of S -approximates that of P, when k "outliers" c...
Pankaj K. Agarwal, Sariel Har-Peled, Hai Yu
137
Voted
COMCOM
2006
80views more  COMCOM 2006»
15 years 4 months ago
The prediction-based routing in optical transport networks
In optical networks, the traditional routing problem is generally decoupled into two subproblems, the route selection and the wavelength assignment. Usual RWA (Routing and Wavelen...
Eva Marín-Tordera, Xavier Masip-Bruin, Serg...
IJAOSE
2008
97views more  IJAOSE 2008»
15 years 4 months ago
Formal driven prototyping approach for multiagent systems
: Even if Multiagent Systems (MASs) are recognised as an appealing paradigm for designing many computer systems ranging from complex distributed systems to intelligent software app...
Vincent Hilaire, Pablo Gruer, Abderrafiaa Koukam, ...
JMLR
2006
93views more  JMLR 2006»
15 years 3 months ago
An Efficient Implementation of an Active Set Method for SVMs
We propose an active set algorithm to solve the convex quadratic programming (QP) problem which is the core of the support vector machine (SVM) training. The underlying method is ...
Katya Scheinberg