Sciweavers

688 search results - page 33 / 138
» The Flow Set with Partial Order
Sort
View
PDPTA
2004
14 years 11 months ago
Achieving Flow Level QoS in Cut-Through Networks Through Admission Control and DiffServ
Cluster networks will serve as the future access networks for multimedia streaming, massive multiplayer online gaming, e-commerce, network storage etc. And for those application ar...
Frank Olaf Sem-Jacobsen, Sven-Arne Reinemo, Tor Sk...
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
13 years 2 days ago
Approximate duality of multicommodity multiroute flows and cuts: single source case
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
Petr Kolman, Christian Scheideler
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
15 years 10 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
JMLR
2012
13 years 3 days ago
Structured Output Learning with High Order Loss Functions
Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation ...
Daniel Tarlow, Richard S. Zemel
78
Voted
TIP
2010
136views more  TIP 2010»
14 years 8 months ago
Wavelet Steerability and the Higher-Order Riesz Transform
Abstract— Our main goal in this paper is to set the foundations of a general continuous-domain framework for designing steerable, reversible signal transformations (a.k.a. frames...
Michael Unser, Dimitri Van De Ville