Sciweavers

2168 search results - page 366 / 434
» Randomized Algorithms and Complexity Theory
Sort
View
CVIU
2004
143views more  CVIU 2004»
15 years 2 months ago
Shape matching of partially occluded curves invariant under projective transformation
This paper describes a method to identify partially occluded shapes which are randomly oriented in 3D space. The goal is to match the object contour present in an image with an ob...
Carlos Orrite, José Elías Herrero Ja...
TOG
2002
133views more  TOG 2002»
15 years 2 months ago
Interactive motion generation from examples
There are many applications that demand large quantities of natural looking motion. It is difficult to synthesize motion that looks natural, particularly when it is people who mus...
Okan Arikan, David A. Forsyth
INFOCOM
2010
IEEE
15 years 1 months ago
Change Management in Enterprise IT Systems: Process Modeling and Capacity-optimal Scheduling
Abstract—We provide a formal model for the Change Management process for Enterprise IT systems, and develop change scheduling algorithms that seek to attain the “change capacit...
Praveen Kumar Muthuswamy, Koushik Kar, Sambit Sahu...
INFOCOM
2010
IEEE
15 years 1 months ago
RIPPLE Authentication for Network Coding
Abstract—By allowing routers to randomly mix the information content in packets before forwarding them, network coding can maximize network throughput in a distributed manner wit...
Yaping Li, Hongyi Yao, Minghua Chen, Sidharth Jagg...
137
Voted
PE
2010
Springer
170views Optimization» more  PE 2010»
15 years 1 months ago
Approximating passage time distributions in queueing models by Bayesian expansion
We introduce Bayesian Expansion (BE), an approximate numerical technique for passage time distribution analysis in queueing networks. BE uses a class of Bayesian networks to appro...
Giuliano Casale