Sciweavers

6368 search results - page 244 / 1274
» Modeling Problem Transformations based on Data Complexity
Sort
View
COCOA
2008
Springer
15 years 8 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
SPAA
2010
ACM
15 years 7 months ago
On the bit communication complexity of randomized rumor spreading
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
Pierre Fraigniaud, George Giakkoupis
BTW
2007
Springer
123views Database» more  BTW 2007»
16 years 1 months ago
Data Provenance: A Categorization of Existing Approaches
: In many application areas like e-science and data-warehousing detailed information about the origin of data is required. This kind of information is often referred to as data pro...
Boris Glavic, Klaus R. Dittrich
CP
1998
Springer
15 years 11 months ago
Modelling CSP Solution Algorithms with Petri Decision Nets
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Stephan Pontow
TSP
2008
121views more  TSP 2008»
15 years 6 months ago
Stochastic Analysis of the LMS Algorithm for System Identification With Subspace Inputs
This paper studies the behavior of the low-rank least mean squares (LMS) adaptive algorithm for the general case in which the input transformation may not capture the exact input s...
Neil J. Bershad, José Carlos M. Bermudez, J...