Sciweavers

1132 search results - page 199 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
INFOCOM
2000
IEEE
13 years 11 months ago
Competitive Queue Policies for Differentiated Services
We consider the setting of a network providing differentiated services. As is often the case in differentiated services, we assume that the packets are tagged as either being a hi...
William Aiello, Yishay Mansour, S. Rajagopolan, Ad...
ICDCS
1995
IEEE
13 years 11 months ago
A Competitive Analysis for Retransmission Timeout
Protocols that provide reliable communicationon top of a network that can lose packets rely on periodically retransmitting packets. The choice of retransmission timeout critically...
Shlomi Dolev, Michael Kate, Jennifer L. Welch
COLT
2008
Springer
13 years 9 months ago
Learning Acyclic Probabilistic Circuits Using Test Paths
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
Dana Angluin, James Aspnes, Jiang Chen, David Eise...
GRAPHICSINTERFACE
2007
13 years 8 months ago
Robust pixel classification for 3D modeling with structured light
Modeling 3D objects and scenes is an important part of computer graphics. One approach to modeling is projecting binary patterns onto the scene in order to obtain correspondences ...
Yi Xu, Daniel G. Aliaga
AAAI
2006
13 years 8 months ago
Optimal Scheduling of Contract Algorithms for Anytime Problems
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the ...
Alejandro López-Ortiz, Spyros Angelopoulos,...