Sciweavers

4047 search results - page 185 / 810
» The Discrete Basis Problem
Sort
View
107
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
135
Voted
COCOA
2008
Springer
15 years 5 months ago
Multiple Hypernode Hitting Sets and Smallest Two-Cores with Targets
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
Peter Damaschke
128
Voted
AUTOMATICA
2002
93views more  AUTOMATICA 2002»
15 years 3 months ago
Hybrid state estimation: a target tracking application
In this paper we present a framework in which the general hybrid filtering or state estimation problem can be formulated. The problem of joint tracking and classification can be f...
Yvo Boers, Hans Driessen
137
Voted
CCE
2004
15 years 3 months ago
Retrospective on optimization
In this paper we provide a general classification of mathematical optimization problems, followed by a matrix of applications that shows the areas in which these problems have bee...
Lorenz T. Biegler, Ignacio E. Grossmann
LATIN
2000
Springer
15 years 7 months ago
Worst-Case Complexity of the Optimal LLL Algorithm
In this paper, we consider the open problem of the complexity of the LLL algorithm in the case when the approximation parameter of the algorithm has its extreme value
Ali Akhavi