412 search results - page 73 / 83 » Algorithmic Complexity Bounds on Future Prediction Errors |
100
click to vote
WWW
2011
ACM
14 years 6 months ago
2011
ACM
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
109
click to vote
TALG
2010
14 years 6 months ago
2010
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
EUROPAR
2009
Springer
15 years 4 months ago
2009
Springer
Multicore architectures featuring specialized accelerators are getting an increasing amount of attention, and this success will probably influence the design of future High Perfor...
102
click to vote
BMCBI
2008
14 years 11 months ago
2008
Background: Accurate peptide identification is important to high-throughput proteomics analyses that use mass spectrometry. Search programs compare fragmentation spectra (MS/MS) o...
78
Voted
ISPD
2000
ACM
15 years 4 months ago
2000
ACM
We address the problem of computing critical area for missing material defects in a circuit layout. The extraction of critical area is the main computational problem in VLSI yield...