Sciweavers

3731 search results - page 636 / 747
» cases 2006
Sort
View
141
Voted
COMGEO
2006
ACM
15 years 21 days ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
95
Voted
CORR
2006
Springer
109views Education» more  CORR 2006»
15 years 21 days ago
On Conditional Branches in Optimal Decision Trees
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
Michael B. Baer
120
Voted
CORR
2006
Springer
140views Education» more  CORR 2006»
15 years 21 days ago
Cooperative Relay Broadcast Channels
The capacity regions are investigated for two relay broadcast channels (RBCs), where relay links are incorporated into two-user broadcast channels to support user cooperation. In t...
Yingbin Liang, Venugopal V. Veeravalli
128
Voted
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 21 days ago
Broadcast Cooperation Strategies for Two Colocated Users
This work considers the problem of communication from a single transmitter, over a network with colocated users, through an independent block Rayleigh fading channel. The colocati...
Avi Steiner, Amichai Sanderovich, Shlomo Shamai
121
Voted
DM
2006
128views more  DM 2006»
15 years 20 days ago
Non-trivial t-designs without repeated blocks exist for all t
A computer package is being developed at Bayreuth for the generation and investigation of discrete structures. The package is a C and C++ class library of powerful algorithms endow...
Luc Teirlinck