Sciweavers

6568 search results - page 131 / 1314
» Reducing the Complexity of Reductions
Sort
View
COCOON
2008
Springer
15 years 8 months ago
Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities
Abstract. We study the maximum flow problem in an undirected planar network with both edge and vertex capacities (EVC-network). A previous study reduces the minimum cut problem in ...
Xianchao Zhang, Weifa Liang, Guoliang Chen
VC
2008
99views more  VC 2008»
15 years 6 months ago
Minimizing probable collision pairs searched in interactive animation authoring
Animation authoring involves an author's interaction with a scene, resulting in varying scene complexity for a given animation sequence. In such a varying environment, detecti...
Parag Agarwal, Srinivas Rajagopalan, B. Prabhakara...
ICRA
2010
IEEE
113views Robotics» more  ICRA 2010»
15 years 5 months ago
Geometric formation control for autonomous underwater vehicles
— This paper presents a novel approach based on Jacobi shape theory and geometric reduction for formation control of autonomous underwater vehicles (AUVs). We consider a three de...
Huizhen Yang, Fumin Zhang
VC
2010
134views more  VC 2010»
15 years 4 months ago
Detail-driven digital hologram generation
Abstract Digital holography is a technology with a potential to provide realistic 3D images. However, generation of digital holograms is a computationally demanding task. Thus, the...
Ivo Hanák, Martin Janda, Václav Skal...
ICTAI
2010
IEEE
15 years 4 months ago
Instance-Based Ensemble Pruning via Multi-Label Classification
Ensemble pruning is concerned with the reduction of the size of an ensemble prior to its combination. Its purpose is to reduce the space and time complexity of the ensemble and/or ...
Fotini Markatopoulou, Grigorios Tsoumakas, Ioannis...