16430 search results - page 851 / 3286 » On Computable Tree Functions |
168
click to vote
CVPR
2003
IEEE
16 years 9 months ago
2003
IEEE
We present a simple and efficient algorithm for modifying the temporal behavior of "dynamic textures," i.e. sequences of images that exhibit some form of temporal regula...
236
click to vote
IPPS
1998
IEEE
15 years 12 months ago
1998
IEEE
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
247
click to vote
BROADNETS
2006
IEEE
15 years 9 months ago
2006
IEEE
Multicast protocols for MANET typically construct a tree or mesh structure for multicast message distribution. Typical implementations impose scalability and efficiency limitation...
176
click to vote
DAGSTUHL
2008
15 years 9 months ago
2008
Allowing templates with infinite domains greatly expands the range of problems that can be formulated as a non-uniform constraint satisfaction problem. It turns out that many CSPs ...
198
click to vote
GC
2007
Springer
15 years 7 months ago
2007
Springer
We develop Gray code enumeration schemes for geometric graphs in the plane. The considered graph classes include plane straight-line graphs, plane spanning trees, and connected pl...