Sciweavers

365 search results - page 59 / 73
» Local Computation Schemes with Partially Ordered Preferences
Sort
View
CAGD
2005
96views more  CAGD 2005»
13 years 7 months ago
Single-knot wavelets for non-uniform B-splines
We propose a flexible and efficient wavelet construction for non-uniform B-spline curves and surfaces. The method allows to remove knots in arbitrary order minimizing the displace...
Martin Bertram
SPIESR
1996
118views Database» more  SPIESR 1996»
13 years 8 months ago
Performances of Multiprocessor Multidisk Architectures for Continuous Media Storage
Multimedia interfaces increase the need for large image databases, capable of storing and reading streams of data with strict synchronicity and isochronicity requirements. In orde...
Benoit A. Gennart, Vincent Messerli, Roger D. Hers...
GLOBECOM
2006
IEEE
14 years 1 months ago
Relay Selection in Multi-Node Cooperative Communications: When to Cooperate and Whom to Cooperate with?
Abstract— In this paper, we propose a new cooperative communication protocol, which achieves high bandwidth efficiency while guaranteeing full diversity order. The proposed sche...
Ahmed S. Ibrahim, Ahmed K. Sadek, Weifeng Su, K. J...
GMP
2010
IEEE
195views Solid Modeling» more  GMP 2010»
13 years 11 months ago
Construction of Minimal Catmull-Clark's Subdivision Surfaces with Given Boundaries
Minimal surface is an important class of surfaces. They are widely used in the areas such as architecture, art and natural science etc.. On the other hand, subdivision technology h...
Qing Pan, Guoliang Xu
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa