523 search results - page 38 / 105 » On the Signal Bounding Problem in Timing Analysis |
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We study the average-case performance of algorithms for the binary knapsack problem. Our focus lies on the analysis of so-called core algorithms, the predominant algorithmic conce...
105
click to vote
PR
2007
15 years 26 days ago
2007
Contrary to popular belief, despite decades of research in fingerprints, reliable fingerprint recognition is still an open problem. Extracting features out of poor quality print...
106
click to vote
IPL
2007
15 years 1 months ago
2007
We deal with the problem of maintaining a dynamic graph so that queries of the form “is there an edge between u and v?” are processed fast. We consider graphs of bounded arbor...
121
click to vote
IPPS
2009
IEEE
15 years 8 months ago
2009
IEEE
We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has speci...
220
click to vote
VLDB
2006
ACM
16 years 1 months ago
2006
ACM
Managing large-scale time series databases has attracted significant attention in the database community recently. Related fundamental problems such as dimensionality reduction, tr...