Sciweavers

9849 search results - page 213 / 1970
» Algorithms and Experiments for the Webgraph
Sort
View
ECAI
2000
Springer
15 years 10 months ago
Scheduling Meetings Using Distributed Valued Constraint Satisfaction Algorithm
Abstract. Scheduling meetings is generally difficult in that it attempts to satisfy the preferences of all participants. However, all participants can agree to a schedule in which...
Takuo Tsuruta, Toramatsu Shintani
SIGCOMM
1994
ACM
15 years 10 months ago
An Algorithm for Lossless Smoothing of MPEG Video
Interframe compression techniques, such as those used in MPEG video, give rise to a coded bit stream where picture sizes di er by a factor of 10 or more. As a result, bu ering is ...
Simon S. Lam, Simon Chow, David K. Y. Yau
FOCS
2000
IEEE
15 years 9 months ago
Efficient Algorithms for Universal Portfolios
A constant rebalanced portfolio is an investment strategy that keeps the same distribution of wealth among a set of stocks from day to day. There has been much work on Cover'...
Adam Kalai, Santosh Vempala
COMPGEOM
1995
ACM
15 years 9 months ago
How Good are Convex Hull Algorithms?
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
David Avis, David Bremner
VLDB
1991
ACM
146views Database» more  VLDB 1991»
15 years 9 months ago
An Evaluation of Non-Equijoin Algorithms
A non-equijoin of relations R and S is a band join if the join predicate requires values in the join attribute of R to fall within a speci ed band about the values in the join att...
David J. DeWitt, Jeffrey F. Naughton, Donovan A. S...