Sciweavers

11814 search results - page 1977 / 2363
» On Generalization by Neural Networks
Sort
View
STOC
2003
ACM
152views Algorithms» more  STOC 2003»
16 years 7 months ago
Reducing truth-telling online mechanisms to online optimization
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
Baruch Awerbuch, Yossi Azar, Adam Meyerson
INFOCOM
2005
IEEE
16 years 12 days ago
Bayesian packet loss detection for TCP
— One of TCP’s critical tasks is to determine which packets are lost in the network, as a basis for control actions (flow control and packet retransmission). Modern TCP implem...
Nahur Fonseca, Mark Crovella
COMPGEOM
2004
ACM
16 years 7 days ago
Low-dimensional embedding with extra information
A frequently arising problem in computational geometry is when a physical structure, such as an ad-hoc wireless sensor network or a protein backbone, can measure local information...
Mihai Badoiu, Erik D. Demaine, Mohammad Taghi Haji...
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
16 years 5 days ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky
ENTCS
2006
117views more  ENTCS 2006»
15 years 6 months ago
A Formalization of Credit and Responsibility Within the GNDC Schema
We formally define a notion of credit and responsibility within the Generalized Non Deducibility on Compositions framework. We investigate the validity of our definitions through ...
Roberto Gorrieri, Fabio Martinelli, Marinella Petr...
« Prev « First page 1977 / 2363 Last » Next »