Sciweavers

2738 search results - page 22 / 548
» The Frobenius Problem and Its Generalizations
Sort
View
WWW
2008
ACM
14 years 8 months ago
Ranking refinement and its application to information retrieval
We consider the problem of ranking refinement, i.e., to improve the accuracy of an existing ranking function with a small set of labeled instances. We are, particularly, intereste...
Rong Jin, Hamed Valizadegan, Hang Li
CSCW
2011
ACM
13 years 2 months ago
It's about time: confronting latency in the development of groupware systems
The presence of network latency leads to usability problems in distributed groupware applications. Example problems include difficulty synchronizing tightly-coupled collaboration...
Cheryl Savery, T. C. Nicholas Graham
ICSE
2011
IEEE-ACM
12 years 11 months ago
A lightweight code analysis and its role in evaluation of a dependability case
A dependability case is an explicit, end-to-end argument, based on concrete evidence, that a system satisfies a critical property. We report on a case study constructing a depend...
Joseph P. Near, Aleksandar Milicevic, Eunsuk Kang,...
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 10 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala
CPAIOR
2007
Springer
14 years 1 months ago
Generalizations of the Global Cardinality Constraint for Hierarchical Resources
Abstract. We propose generalizations of the Global Cardinality Constraint (gcc) in which a partition of the variables is given. In the context of resource allocation problems, such...
Alessandro Zanarini, Gilles Pesant