33 search results - page 4 / 7 » Upper Bound on Pattern Storage in Feedforward Networks |
132
click to vote
ECCV
2010
Springer
15 years 9 months ago
2010
Springer
Bourdev and Malik (ICCV 09) introduced a new notion of parts, poselets, constructed to be tightly clustered both in the configuration space of keypoints, as well as in the appeara...
150
Voted
DIALM
2005
ACM
15 years 6 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
139
click to vote
INFOCOM
2009
IEEE
15 years 11 months ago
2009
IEEE
—We analyze how node mobility can influence the convergence time of averaging gossip algorithms on networks. Our main result is that even a small number of fully mobile nodes ca...
237
click to vote
GIS
2007
ACM
16 years 5 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
144
click to vote
INFOCOM
2002
IEEE
15 years 9 months ago
2002
IEEE
— Optical Burst Switching (OBS) is an experimental network technology that enables the construction of very high capacity routers, using optical data paths and electronic control...