Sciweavers

7106 search results - page 184 / 1422
» Restricted Complexity, General Complexity
Sort
View
110
Voted
COCOA
2008
Springer
15 years 5 months ago
Fixed-Parameter Tractability of Anonymizing Data by Suppressing Entries
A popular model for protecting privacy when person-specific data is released is k-anonymity. A dataset is k-anonymous if each record is identical to at least (k - 1) other records ...
Rhonda Chaytor, Patricia A. Evans, Todd Wareham
128
Voted
CORR
2008
Springer
80views Education» more  CORR 2008»
15 years 3 months ago
Multi-Layer Perceptrons and Symbolic Data
In some real world situations, linear models are not sufficient to represent accurately complex relations between input variables and output variables of a studied system. Multila...
Fabrice Rossi, Brieuc Conan-Guez
92
Voted
CAGD
2000
61views more  CAGD 2000»
15 years 3 months ago
Efficient evaluation of triangular B-spline surfaces
Evaluation routines are essential for any application that uses triangular B-spline surfaces. This paper describes an algorithm to efficiently evaluate triangular B-spline surface...
Michael Franssen, Remco C. Veltkamp, Wieger Wessel...
239
Voted
AMW
2011
14 years 7 months ago
Bag Equivalence of Bounded Symmetry-Degree Conjunctive Queries with Inequalities
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
Mingmin Chen, Todd J. Green
130
Voted
TIT
2011
131views more  TIT 2011»
14 years 10 months ago
On the Hardness of Approximating the Network Coding Capacity
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...
Michael Langberg, Alexander Sprintson