1201 search results - page 41 / 241 » Linear Probing and Graphs |
137
Voted
LCC
1994
15 years 4 months ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
77
Voted
JSAC
2008
15 years 13 days ago
2008
Abstract--In this paper, a vector-form factor graph representation is derived for intersymbol interference (ISI) channels. The resultant graphs have a tree-structure that avoids th...
132
Voted
JCSC
1998
15 years 4 days ago
1998
: Continuous and hybrid Petri nets can be seen as relaxation of discrete nets, in which the firing of some or of all transitions is approximated with a fluid model. Several analysi...
ICCV
2005
IEEE
16 years 2 months ago
2005
IEEE
Face recognition under varying illumination remains a challenging problem. Much progress has been made toward a solution through methods that require multiple gallery images of ea...
GLOBECOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— Routing policies used in the Internet can be restrictive, limiting communication between source-destination pairs to one path, when often better alternatives exist. To avoid ro...