3958 search results - page 440 / 792 » Dynamic Graph Algorithms with Applications |
164
click to vote
JMLR
2010
15 years 1 months ago
2010
Kernel approximation is commonly used to scale kernel-based algorithms to applications containing as many as several million instances. This paper analyzes the effect of such appr...
193
click to vote
MM
2005
ACM
16 years 7 days ago
2005
ACM
To locate a video clip in large collections is very important for retrieval applications, especially for digital rights management. In this paper, we present a novel technique for...
394
click to vote
PAMI
2010
15 years 5 months ago
2010
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
175
click to vote
PUC
2008
15 years 6 months ago
2008
A number of emerging distributed platforms include xed and robust workstations but, like dynamic and pervasive networks, are often built from mobile and resource-constrained device...
175
click to vote
MICRO
2000
IEEE
15 years 10 months ago
2000
IEEE
Conventional microarchitectures choose a single memory hierarchy design point targeted at the average application. In this paper, we propose a cache and TLB layout and design that...