Sciweavers

64 search results - page 12 / 13
» The Complexity of the List Homomorphism Problem for Graphs
Sort
View
ICDM
2005
IEEE
148views Data Mining» more  ICDM 2005»
13 years 11 months ago
Hot Item Mining and Summarization from Multiple Auction Web Sites
Online auction Web sites are fast changing, highly dynamic, and complex as they involve tremendous sellers and potential buyers, as well as a huge amount of items listed for biddi...
Tak-Lam Wong, Wai Lam
CONCUR
1998
Springer
13 years 10 months ago
Algebraic Techniques for Timed Systems
Performance evaluation is a central issue in the design of complex real-time systems. In this work, we propose an extension of socalled "Max-Plus" algebraic techniques to...
Albert Benveniste, Claude Jard, Stephane Gaubert
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
13 years 10 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
STOC
2003
ACM
171views Algorithms» more  STOC 2003»
14 years 6 months ago
Primal-dual meets local search: approximating MST's with nonuniform degree bounds
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
Jochen Könemann, R. Ravi
SIGGRAPH
1997
ACM
13 years 9 months ago
The visibility skeleton: a powerful and efficient multi-purpose global visibility tool
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
Frédo Durand, George Drettakis, Claude Puec...