Sciweavers

1333 search results - page 56 / 267
» Not a Number of Floating Point Problems
Sort
View
164
Voted
SIAMCOMP
1998
92views more  SIAMCOMP 1998»
15 years 3 months ago
Surface Approximation and Geometric Partitions
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
Pankaj K. Agarwal, Subhash Suri
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
15 years 10 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
136
Voted
MVA
1990
137views Computer Vision» more  MVA 1990»
15 years 4 months ago
Relaxation Based Modeling and Recognition of 3D Surfaces from Range Data
Modeling and recognition of 3D objects by surface is an important problem in machine vision. Given a large number of range data points of an object surface, we present a relaxatio...
Chang Y. Choo, Nasser M. Nasrabadi, William I. Kwa...
119
Voted
APPROX
2004
Springer
122views Algorithms» more  APPROX 2004»
15 years 9 months ago
Maximum Coverage Problem with Group Budget Constraints and Applications
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
Chandra Chekuri, Amit Kumar
155
Voted
WSNA
2003
ACM
15 years 8 months ago
The coverage problem in a wireless sensor network
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
Chi-Fu Huang, Yu-Chee Tseng