207 search results - page 3 / 42 » Run-Time Switching Between Total Order Algorithms |
SCALESPACE
2005
Springer
14 years 26 days ago
2005
Springer
We study the connection between higher order total variation (TV) regularization and support vector regression (SVR) with spline kernels in a one-dimensional discrete setting. We p...
DAC
1994
ACM
13 years 11 months ago
1994
ACM
- This paper studies the routing problem for a new Field-Programmable Gate Array (FPGA) and Field-Programmable Interconnect Chip (FPIC) routing architecture which improves upon the...
SODA
2003
ACM
13 years 8 months ago
2003
ACM
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
JDA
2007
13 years 7 months ago
2007
Ordering a set of items so as to minimize the sum of distances between consecutive elements is a fundamental optimization problem occurring in many settings. While it is NP-hard i...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
—We consider the problem of designing a network which minimizes the total cost of the switching facilities and the fiber links, by choosing the subset of nodes at which to insta...