15485 search results - page 2883 / 3097 » Computing Optimal Subsets |
196
click to vote
CLUSTER
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
280
click to vote
ISCA
2002
IEEE
15 years 6 months ago
2002
IEEE
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
228
click to vote
IJCV
1998
15 years 6 months ago
1998
This paper presents a method that uses the level sets of volumes to reconstruct the shapes of 3D objects from range data. The strategy is to formulate 3D reconstruction as a stati...
222
click to vote
COMGEO
1999
ACM
15 years 6 months ago
1999
ACM
The use of polygonal meshes for the representation of highly complex geometric objects has become the de facto standard in most computer graphics applications. Especially triangle...
169
click to vote
TEC
2002
15 years 6 months ago
2002
Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( 3) computational complexity (where is the number ...