Sciweavers

14165 search results - page 656 / 2833
» The generalized two-server problem
Sort
View
DM
2010
103views more  DM 2010»
15 years 7 months ago
Rainbow paths
A k-rainbow path in a graph with colored edges is a path of length k where each edge has a different color. In this note, we settle the problem of obtaining a constructive k-colori...
Domingos Dellamonica Jr., Colton Magnant, Daniel M...
IAJIT
2008
223views more  IAJIT 2008»
15 years 7 months ago
A New Exam Scheduling Algorithm Using Graph Coloring
: This paper presents a graph-coloring-based algorithm for the exam scheduling application, with the objective of achieving fairness, accuracy, and optimal exam time period. Throug...
Mohammad Malkawi, Mohammad Al-Haj Hassan, Osama Al...
CORR
2006
Springer
178views Education» more  CORR 2006»
15 years 7 months ago
Low-rank matrix factorization with attributes
We develop a new collaborative filtering (CF) method that combines both previously known users' preferences, i.e. standard CF, as well as product/user attributes, i.e. classi...
Jacob Abernethy, Francis Bach, Theodoros Evgeniou,...
CORR
2006
Springer
88views Education» more  CORR 2006»
15 years 7 months ago
On Typechecking Top-Down XML Tranformations: Fixed Input or Output Schemas
Typechecking consists of statically verifying whether the output of an XML transformation always conforms to an output type for documents satisfying a given input type. In this ge...
Wim Martens, Frank Neven, Marc Gyssens
FS
2006
102views more  FS 2006»
15 years 7 months ago
Bounds for Functions of Dependent Risks
Abstract The problem of finding the best-possible lower bound on the distribution of a non-decreasing function of n dependent risks is solved when n = 2 and a lower bound on the co...
Paul Embrechts, Giovanni Puccetti