Sciweavers

SLS
2007
Springer
117views Algorithms» more  SLS 2007»
13 years 11 months ago
An Algorithm Portfolio for the Sub-graph Isomorphism Problem
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
Roberto Battiti, Franco Mascia
ICDCS
2008
IEEE
13 years 11 months ago
Towards Multi-Site Collaboration in 3D Tele-Immersive Environments
3D tele-immersion (3DTI) has recently emerged as a new way of video-mediated collaboration across the Internet. Unlike conventional 2D video-conferencing systems, it can immerse r...
Wanmin Wu, Zhenyu Yang, Indranil Gupta, Klara Nahr...
SIGECOM
2009
ACM
108views ECommerce» more  SIGECOM 2009»
13 years 11 months ago
Selling ad campaigns: online algorithms with cancellations
We study online pricing problems in markets with cancellations, i.e., markets in which prior allocation decisions can be revoked, but at a cost. In our model, a seller receives re...
Moshe Babaioff, Jason D. Hartline, Robert D. Klein...
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
13 years 11 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
SODA
2010
ACM
168views Algorithms» more  SODA 2010»
14 years 2 months ago
An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
We consider the Asymmetric Traveling Salesman problem for costs satisfying the triangle inequality. We derive a randomized algorithm which delivers a solution within a factor O(lo...
Arash Asadpour, Michel X. Goemans, Aleksander Madr...
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
14 years 5 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
ICDE
2005
IEEE
108views Database» more  ICDE 2005»
14 years 6 months ago
Range Efficient Computation of F0 over Massive Data Streams
Efficient one-pass computation of F0, the number of distinct elements in a data stream, is a fundamental problem arising in various contexts in databases and networking. We consid...
Pavan Aduri, Srikanta Tirthapura