Sciweavers

725 search results - page 106 / 145
» Bounding Degrees on RPL
Sort
View
CAD
1999
Springer
14 years 11 months ago
Computing offsets of NURBS curves and surfaces
This paper presents algorithms for computing offsets of NURBS curves and surfaces. The basic approach consists of four steps: (1) recognition of special curves and surfaces; (2) s...
Les A. Piegl, Wayne Tiller
JCS
2008
94views more  JCS 2008»
14 years 10 months ago
Preprocessing for controlled query evaluation with availability policy
Controlled Query Evaluation (CQE) defines a logical framework to protect confidential information in a database. By modeling a user's a priori knowledge appropriately, a CQE ...
Joachim Biskup, Lena Wiese
ISAAC
2010
Springer
233views Algorithms» more  ISAAC 2010»
14 years 9 months ago
Computing Sparse Multiples of Polynomials
We consider the problem of finding a sparse multiple of a polynomial. Given f F[x] of degree d, and a desired sparsity t, our goal is to determine if there exists a multiple h F[...
Mark Giesbrecht, Daniel S. Roche, Hrushikesh Tilak
TMC
2011
131views more  TMC 2011»
14 years 6 months ago
In-Network Computation in Random Wireless Networks: A PAC Approach to Constant Refresh Rates with Lower Energy Costs
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
Srikanth K. Iyer, D. Manjunath, R. Sundaresan
TSMC
2011
228views more  TSMC 2011»
14 years 6 months ago
Privacy-Preserving Outlier Detection Through Random Nonlinear Data Distortion
— Consider a scenario in which the data owner has some private/sensitive data and wants a data miner to access it for studying important patterns without revealing the sensitive ...
Kanishka Bhaduri, Mark D. Stefanski, Ashok N. Sriv...