2131 search results - page 57 / 427 » Immunity for Closed Sets |
96
Voted
LATIN
2010
Springer
15 years 7 months ago
2010
Springer
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
97
Voted
ISORC
2007
IEEE
15 years 7 months ago
2007
IEEE
Knowing the program timing characteristics is fundamental to the successful design and execution of real-time systems. Today, measurement-based timing analysis tools such as in-ci...
106
click to vote
ISAAC
2009
Springer
15 years 5 months ago
2009
Springer
For a connected graph G = (V, E), a subset U ⊆ V is called a k-cut if U disconnects G, and the subgraph induced by U contains exactly k (≥ 1) components. More specifically, a ...
106
Voted
CVIU
2008
15 years 25 days ago
2008
In this paper we introduce a novel method to address minimization of static and dynamic MRFs. Our approach is based on principles from linear programming and, in particular, on pr...
64
Voted
TROB
2010
14 years 11 months ago
2010
—We propose a novel framework, passive set-position modulation (PSPM), which enables us to connect a (continuoustime) robot’s position to a sequence of slowly-updating/sparse (...