Sciweavers

641 search results - page 59 / 129
» Branch and Bound Algorithm Selection by Performance Predicti...
Sort
View
INFOCOM
1993
IEEE
15 years 1 months ago
Queueing Delays in Rate Controlled ATM Networks
This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in ATM networks with rate-controlled, non-work conserving servers. A theore...
Anindo Banerjea, Srinivasan Keshav
ICCV
2009
IEEE
16 years 2 months ago
Efficient subset selection based on the Renyi entropy
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed t...
Vlad I. Morariu1, Balaji V. Srinivasan, Vikas C. R...
74
Voted
AI
2003
Springer
15 years 3 months ago
Stochastic Local Search for Multiprocessor Scheduling for Minimum Total Tardiness
The multi-processor total tardiness problem (MPTTP) is an ÆÈ-hard scheduling problem, in which the goal is to minimise the tardiness of a set of jobs that are processed on a numb...
Michael Pavlin, Holger H. Hoos, Thomas Stützl...
BMCBI
2008
136views more  BMCBI 2008»
14 years 10 months ago
A comparison of machine learning algorithms for chemical toxicity classification using a simulated multi-scale data model
Background: Bioactivity profiling using high-throughput in vitro assays can reduce the cost and time required for toxicological screening of environmental chemicals and can also r...
Richard Judson, Fathi Elloumi, R. Woodrow Setzer, ...
ICIP
2005
IEEE
15 years 11 months ago
Stochastic frame buffers for rate distortion optimized loss resilient video communications
In this paper we propose an error control scheme for video communications over lossy channels. The proposed algorithm uses stochastic frame buffers(SFB) to determine the expected ...
Oztan Harmanci, A. Murat Tekalp