494 search results - page 77 / 99 » Heap Building Bounds |
JMLR
2010
14 years 5 months ago
2010
Matrix factorization is a successful technique for building collaborative filtering systems. While it works well on a large range of problems, it is also known for requiring signi...
101
click to vote
TPDS
2010
14 years 5 months ago
2010
In the past, some research has been done on how to use proactive recovery to build intrusion-tolerant replicated systems that are resilient to any number of faults, as long as reco...
168
click to vote
INFOCOM
2011
IEEE
14 years 2 months ago
2011
IEEE
—It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless n...
162
click to vote
ICALP
2011
Springer
14 years 2 months ago
2011
Springer
Given an unlabeled, unweighted, and undirected graph with n vertices and small (but not necessarily constant) treewidth k, we consider the problem of preprocessing the graph to bui...
104
click to vote
SODA
2012
ACM
13 years 1 months ago
2012
ACM
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...