Sciweavers

2421 search results - page 391 / 485
» Approximate Flow-Aware Networking
Sort
View
INFOCOM
2003
IEEE
14 years 1 months ago
Opportunistic Fair Scheduling over Multiple Wireless Channels
Abstract— Emerging spread spectrum high-speed data networks utilize multiple channels via orthogonal codes or frequency-hopping patterns such that multiple users can transmit con...
Yonghe Liu, Edward W. Knightly
ICANN
2003
Springer
14 years 1 months ago
Learning Rule Representations from Boolean Data
We discuss a Probably Approximate Correct (PAC) learning paradigm for Boolean formulas, which we call PAC meditation, where the class of formulas to be learnt is not known in advan...
Bruno Apolloni, Andrea Brega, Dario Malchiodi, Gio...
3DPVT
2002
IEEE
146views Visualization» more  3DPVT 2002»
14 years 1 months ago
Geometry of Contour-based Correspondence for Stereo
We consider the problem of computing stereo correspondence for scenes dense in physical structure, such as a bouquet of flowers. Boundaries are then space curves, formally govern...
Steven W. Zucker, Gang Li
ICDCSW
2002
IEEE
14 years 1 months ago
Event Systems: How to Have Your Cake and Eat It Too
This paper addresses the fundamental tradeoffs in event systems between scalability (of event filtering, routing, and delivery mechanisms), expressiveness (when describing intere...
Patrick Th. Eugster, Pascal Felber, Rachid Guerrao...
STOC
2010
ACM
193views Algorithms» more  STOC 2010»
14 years 28 days ago
Maintaining a large matching and a small vertex cover
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
Krzysztof Onak, Ronitt Rubinfeld