Sciweavers

1099 search results - page 150 / 220
» On the Complexity of Computing Evolutionary Trees
Sort
View
IPL
2002
118views more  IPL 2002»
14 years 10 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
NETGAMES
2006
ACM
15 years 4 months ago
Applicability of group communication for increased scalability in MMOGs
Massive multiplayer online games (MMOGs) are today the driving factor for the development of distributed interactive applications, and they are increasing in size and complexity. ...
Knut-Helge Vik, Carsten Griwodz, Pål Halvors...
77
Voted
ECCV
2006
Springer
16 years 2 days ago
Feature Harvesting for Tracking-by-Detection
We propose a fast approach to 3?D object detection and pose estimation that owes its robustness to a training phase during which the target object slowly moves with respect to the ...
Mustafa Özuysal, Vincent Lepetit, Franç...
EUROGRAPHICS
2010
Eurographics
15 years 7 months ago
Human Motion Synthesis with Optimization-based Graphs
Continuous constrained optimization is a powerful tool for synthesizing novel human motion segments that are short. Graph-based motion synthesis methods such as motion graphs and ...
Cheng Ren, Liming Zhao, Alla Safonova
84
Voted
TWC
2008
100views more  TWC 2008»
14 years 10 months ago
Generalized feedback detection for spatial multiplexing multi-antenna systems
Abstract-- We present a unified detection framework for spatial multiplexing multiple-input multiple-output (MIMO) systems by generalizing Heller's classical feedback decoding...
Tao Cui, Chintha Tellambura