1819 search results - page 205 / 364 » Computability and Representations of the Zero Set |
155
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
- This paper describes a symbolic formulation that allows incorporation of speculative operation execution (preexecution) in an exact control-dependent scheduling of arbitrary forw...
199
click to vote
PODC
2010
ACM
15 years 10 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
176
click to vote
WCNC
2010
IEEE
15 years 10 months ago
2010
IEEE
—The performance of a cooperative network with Cooperative Maximal Ratio Combining (C-MRC) is analyzed. To this end, we propose a heuristic approximation to the total received SN...
183
click to vote
PODC
1995
ACM
15 years 10 months ago
1995
ACM
We show how solution concepts in games such as Nash equilibrium, correlated equilibrium, rationalizability, and sequential equilibrium can be given a uniform definition in terms ...
131
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Abstract--In this paper, we propose a novel appearancebased method for person re-identification, that condenses a set of frames of the same individual into a highly informative sig...