Sciweavers

278 search results - page 20 / 56
» Algorithmic randomness and monotone complexity on product sp...
Sort
View
JMLR
2010
109views more  JMLR 2010»
13 years 3 months ago
Matrix Completion from Noisy Entries
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
SWAT
2000
Springer
97views Algorithms» more  SWAT 2000»
14 years 20 hour ago
I/O-Space Trade-Offs
We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory mode...
Lars Arge, Jakob Pagter
ICDE
2006
IEEE
144views Database» more  ICDE 2006»
14 years 9 months ago
Approximately Processing Multi-granularity Aggregate Queries over Data Streams
Aggregate monitoring over data streams is attracting more and more attention in research community due to its broad potential applications. Existing methods suffer two problems, 1...
Shouke Qin, Weining Qian, Aoying Zhou
ECCC
2000
140views more  ECCC 2000»
13 years 8 months ago
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
Pavlos Efraimidis, Paul G. Spirakis
DAC
2011
ACM
12 years 8 months ago
Supervised design space exploration by compositional approximation of Pareto sets
Technology scaling allows the integration of billions of transistors on the same die but CAD tools struggle in keeping up with the increasing design complexity. Design productivit...
Hung-Yi Liu, Ilias Diakonikolas, Michele Petracca,...