2996 search results - page 145 / 600 » Numberings and Randomness |
166
click to vote
TKDE
2002
15 years 5 months ago
2002
Our goal with this paper is to contribute a common theoretical framework for studying the performance of disk-storage devices. Understanding the performance behavior of these devi...
160
click to vote
SPAA
2009
ACM
16 years 6 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
179
click to vote
FOCS
2008
IEEE
15 years 12 months ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
199
click to vote
JMLR
2008
15 years 5 months ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...
152
click to vote
TNN
2011
15 years 13 days ago
2011
Abstract—Most signal processing problems involve the challenging task of multidimensional probability density function (PDF) estimation. In this paper, we propose a solution to t...