3656 search results - page 202 / 732 » Compact Location Problems |
164
click to vote
SPAA
2005
ACM
15 years 11 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
128
Voted
PASTE
2004
ACM
15 years 11 months ago
2004
ACM
This paper presents FIT, a Flexible open-source binary code Instrumentation Toolkit. Unlike existing tools, FIT is truly portable, with existing backends for the Alpha, x86 and AR...
164
click to vote
LPAR
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We describe a novel decision procedure for Quantified Boolean Formulas (QBFs) which aims to unleash the hidden potential of quantified reasoning in applications. The Sk...
148
click to vote
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We address the problem of learning good features for understanding video data. We introduce a model that learns latent representations of image sequences from pairs of su...
142
click to vote
AIIA
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Efficiency of the first-order logic proof procedure is a major issue when deduction systems are to be used in real environments, both on their own and as a component of ...