5221 search results - page 760 / 1045 » An On-line Problem Database |
169
click to vote
ICDT
2010
ACM
15 years 5 months ago
2010
ACM
We propose a greedy algorithm which, given a hypergraph H and a positive integer k, produces a hypertree decomposition of width less than or equal to 3k −1, or determines that H...
197
click to vote
CIKM
2010
Springer
15 years 5 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
155
click to vote
IJDAR
2010
15 years 5 months ago
2010
The set of references that typically appear toward the end of journal articles is sometimes, though not always, a field in bibliographic (citation) databases. But even if referenc...
190
click to vote
TIFS
2010
15 years 5 months ago
2010
Abstract—Biometric template protection is one of the most important issues in deploying a practical biometric system. To tackle this problem, many algorithms, that do not store t...
211
click to vote
GIS
2010
ACM
15 years 4 months ago
2010
ACM
The sensing systems that monitor physical environments rely on communication infrastructures (wired or wireless) to collect data from the sensors embedded in the environment. Howe...