2370 search results - page 215 / 474 » The Characterization of Data-Accumulating Algorithms |
154
click to vote
INFOCOM
2010
IEEE
15 years 2 months ago
2010
IEEE
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
113
click to vote
MP
2010
15 years 2 months ago
2010
Abstract We present a matrix-free line search algorithm for large-scale equality constrained optimization that allows for inexact step computations. For sufficiently convex problem...
136
Voted
PVLDB
2010
15 years 2 months ago
2010
Graph pattern matching is typically defined in terms of subgraph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often to...
181
click to vote
SASO
2010
IEEE
15 years 1 months ago
2010
IEEE
Many large-scale distributed systems have been built with great complexity to run Internet services. Due to the heterogeneity and dynamics of complex systems, it is very difficult ...
145
click to vote
CVPR
1999
IEEE
16 years 6 months ago
1999
IEEE
A spatio-temporal representation for complex optical flow events is developed that generalizes traditional parameterized motion models (e.g. affine). These generative spatio-tempo...