Sciweavers

327 search results - page 27 / 66
» Algorithms for infinite huffman-codes
Sort
View
ICMS
2010
13 years 8 months ago
Computing Polycyclic Quotients of Finitely (L-)Presented Groups via Groebner Bases
We announce the development and implementation of a new GAP package PCQL. This facilitates the computation of consistent polycyclic presentations for polycyclic quotients of groups...
Bettina Eick, Max Horn
ICCV
2001
IEEE
15 years 24 days ago
Linear Multi View Reconstruction and Camera Recovery
This paper presents a linear algorithm for the simultaneous computation of 3D points and camera positions from multiple perspective views, based on having four points on a referen...
Carsten Rother, Stefan Carlsson
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 11 months ago
How to meet asynchronously (almost) everywhere
Two mobile agents (robots) with distinct labels have to meet in an arbitrary, possibly infinite, unknown connected graph or in an unknown connected terrain in the plane. Agents ar...
Jurek Czyzowicz, Arnaud Labourel, Andrzej Pelc
JSSPP
2004
Springer
14 years 4 months ago
Reconfigurable Gang Scheduling Algorithm
 Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
Luís Fabrício Wanderley Góes,...
NETWORKING
2000
14 years 7 days ago
An Exact Algorithm for Calculating Blocking Probabilities in Multicast Networks
Abstract. The paper deals with tree-structured point-to-multipoint networks, where users from infinite user populations at the leaf nodes subscribe to a variety of channels, offere...
Eeva Nyberg, Jorma T. Virtamo, Samuli Aalto