Sciweavers

3211 search results - page 427 / 643
» On the Grundy Number of a Graph
Sort
View
RSA
2010
107views more  RSA 2010»
15 years 5 months ago
Continuum limits for classical sequential growth models
A random graph order, also known as a transitive percolation process, is defined by taking a random graph on the vertex set {0, . . . , n − 1}, and putting i below j if there i...
Graham Brightwell, Nicholas Georgiou
SIGECOM
2006
ACM
106views ECommerce» more  SIGECOM 2006»
16 years 16 days ago
Approximation algorithms and online mechanisms for item pricing
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
Maria-Florina Balcan, Avrim Blum
WWW
2009
ACM
16 years 7 months ago
A flight meta-search engine with metamorph
We demonstrate a flight meta-search engine that is based on the Metamorph framework. Metamorph provides mechanisms to model web forms together with the interactions which are need...
Bernhard Krüpl, Wolfgang Holzinger, Yansen Da...
KDD
2006
ACM
185views Data Mining» more  KDD 2006»
16 years 7 months ago
Understanding Content Reuse on the Web: Static and Dynamic Analyses
Abstract. In this paper we present static and dynamic studies of duplicate and near-duplicate documents in the Web. The static and dynamic studies involve the analysis of similar c...
Ricardo A. Baeza-Yates, Álvaro R. Pereira J...
ICDCS
2009
IEEE
16 years 1 months ago
On Optimal Concurrency Control for Optimistic Replication
Concurrency control is a core component in optimistic replication systems. To detect concurrent updates, the system associates each replicated object with metadata, such as, versi...
Weihan Wang, Cristiana Amza