54 search results - page 8 / 11 » The Complexity of Perfect Matching Problems on Dense Hypergr... |
117
click to vote
TCOM
2010
14 years 10 months ago
2010
—In this paper, we consider cross-layer optimization in wireless networks with wireless broadcast advantage, focusing on the problem of distributed scheduling of broadcast links....
96
Voted
FOCS
2000
IEEE
15 years 4 months ago
2000
IEEE
We show that the graph isomorphism problem is hard under DLOGTIME uniform AC0 many-one reductions for the complexity classes NL, PL (probabilistic logarithmic space) for every loga...
116
Voted
3DIM
1999
IEEE
15 years 4 months ago
1999
IEEE
Modeling of 3D objects from image sequences is a challenging problem and has been a research topic for many years. Important theoretical and algorithmic results were achieved that...
115
click to vote
LFCS
2007
Springer
15 years 5 months ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
ICB
2007
Springer
15 years 5 months ago
2007
Springer
Gait can be easily acquired at a distance, so it has become a popular biometric especially in intelligent visual surveillance. In gait-based human identification there are many fa...