Results 1 - 10 of 1,476

Online Learning with Kernels

by Jyrki Kivinen, Alexander J. Smola, Robert C. Williamson , 2003
"... Kernel based algorithms such as support vector machines have achieved considerable success in various problems in the batch setting where all of the training data is available in advance. Support vector machines combine the so-called kernel trick with the large margin idea. There has been little u ..."
Abstract - Cited by 2831 (123 self) - Add to MetaCart
Kernel based algorithms such as support vector machines have achieved considerable success in various problems in the batch setting where all of the training data is available in advance. Support vector machines combine the so-called kernel trick with the large margin idea. There has been little

Scheduling Policies for an On-Demand Video Server with Batching

by Asit Dan, Dinkar Sitaram, Perwez Shahabuddin - in Proc. of ACM Multimedia , 1994
"... In an on-demand video server environment, clients make requests for movies to a centralized video server. Due to the stringent response time requirements, continuous delivery of a video stream to the client has to be guaranteed by reserving sufficient resources required to deliver a stream. Hence th ..."
Abstract - Cited by 330 (8 self) - Add to MetaCart
be achieved by batching requests for the same movie that arrive within a short duration of time. In this paper, we consider various policies for selecting the movie to be multicast. The choice of a policy depends very much on the customer waiting time tolerance before reneging. We show that an FCFS policy

The Evolution of the Web and Implications for an Incremental Crawler

by Junghoo Cho, Hector Garcia-molina , 1999
"... In this paper we study how to build an effective incremental crawler. The crawler selectively and incrementally updates its index and/or local collection of web pages, instead of periodically refreshing the collection in batch mode. The incremental crawler can improve the "freshness" of th ..."
Abstract - Cited by 281 (18 self) - Add to MetaCart
In this paper we study how to build an effective incremental crawler. The crawler selectively and incrementally updates its index and/or local collection of web pages, instead of periodically refreshing the collection in batch mode. The incremental crawler can improve the "

various

by J. C. Akunna, C. Jefferies
"... Performance of family-size sequencing batch reactor and ..."
Abstract - Add to MetaCart
Performance of family-size sequencing batch reactor and

Efficient data mining for path traversal patterns

by Ming-syan Chen, Senior Member, Jong Soo Park, Philip S. Yu - IEEE Transactions on Knowledge and Data Engineering , 1998
"... Abstract—In this paper, we explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects are linked together to facilitate interactive access. Our solution procedure consists of two steps. First, we der ..."
Abstract - Cited by 217 (16 self) - Add to MetaCart
of determining large reference sequences in batch so as to reduce the number of database scans required. Performance of these two methods is comparatively analyzed. It is shown that the option of selective scan is very advantageous and can lead to prominent performance improvement. Sensitivity analysis

Combining batch execution and leasing using virtual machines

by Borja Sotomayor, Kate Keahey, Ian Foster - In HPDC ’08: Proceedings of the 17th international symposium on High performance distributed computing , 2008
"... As cluster computers are used for a wider range of applications, we encounter the need to deliver resources at particular times, to meet particular deadlines, and/or at the same time as other resources are provided elsewhere. To address such requirements, we describe a scheduling approach in which u ..."
Abstract - Cited by 83 (5 self) - Add to MetaCart
with various mixes of best-effort and advance reservation requests, we compare the performance of our VM-based approach with that of non-VMbased schedulers. We find that a VM-based approach can provide better performance (measured in terms of both total execution time and average delay incurred by best

Batched multi triangulation

by Paolo Cignoni, Fabio Ganovelli, Enrico Gobbetti , Fabio Marton, Federico Ponchio , Roberto Scopigno - IN PROCEEDINGS IEEE VISUALIZATION (CONFERENCE HELD IN , 2005
"... The Multi Triangulation framework (MT) is a very general approach for managing adaptive resolution in triangle meshes. The key idea is arranging mesh fragments at different resolution in a Directed Acyclic Graph (DAG) which encodes the dependencies between fragments, thereby encompassing a wide clas ..."
Abstract - Cited by 32 (18 self) - Add to MetaCart
-partitions, that can encompass various state of the art multiresolution algorithms; an efficient multithreaded rendering engine and a general subsystem for the external memory processing and simplification of huge meshes.

Supply Chain Scheduling: Batching and Delivery

by Nicholas G. Hall, Chris N. Potts - Operations Research , 2000
"... This paper considers a variety of scheduling, batching and delivery problems that arise in supply chain manufacturing. In these problems, the aim is to minimize the overall delivery and scheduling cost, and this is achieved by forming batches of orders, each of which is delivered from supplier to ma ..."
Abstract - Cited by 38 (2 self) - Add to MetaCart
This paper considers a variety of scheduling, batching and delivery problems that arise in supply chain manufacturing. In these problems, the aim is to minimize the overall delivery and scheduling cost, and this is achieved by forming batches of orders, each of which is delivered from supplier

The batch loading and scheduling problem

by Gregory Dobson, Ramakrishnan S. Nambimadom, Gregory Dobson, Ramakrishnan S. Nambimadom - Oper. Res
"... This paper discusses a problem that commonly occurs in the batching and schedulingof certainkinds of batch processors. Examplesof these processors include heat treatment facilities, particularly in the steeland ceramicindustries as well as a varietyof operations in the manufacture of integratedcircu ..."
Abstract - Cited by 15 (0 self) - Add to MetaCart
This paper discusses a problem that commonly occurs in the batching and schedulingof certainkinds of batch processors. Examplesof these processors include heat treatment facilities, particularly in the steeland ceramicindustries as well as a varietyof operations in the manufacture

Combinatorial Batch Codes

by M. B. Paterson, D. R. Stinson, R. Wei , 2008
"... In this paper, we study batch codes, which were introduced by Ishai, Kushilevitz, Ostrovsky and Sahai in [3]. A batch code specifies a method to distribute a database of n items among m devices (servers) in such a way that any k items can be retrieved by reading at most t items from each of the serv ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
code a “combinatorial batch code”. For various parameter situations, we are able to present batch codes that are optimal with respect to the storage requirement, N. We also study uniform codes, where every item is stored in precisely c of the m servers (such a code is said to have rate 1/c
Results 1 - 10 of 1,476