Sciweavers

4908 search results - page 195 / 982
» On the Complexity of Optimal K-Anonymity
Sort
View
MOR
2006
95views more  MOR 2006»
15 years 6 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
ORL
2008
90views more  ORL 2008»
15 years 6 months ago
Optimal bundle pricing with monotonicity constraint
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
Alexander Grigoriev, Joyce van Loon, Maxim Sviride...
IJFCS
2007
77views more  IJFCS 2007»
15 years 6 months ago
Optimal Construction of Sense of Direction in a Torus by a Mobile Agent
Sense of direction is a property of the edge-labeling of a network whose availability facilitates computations and often decreases their complexity. In this paper we consider the ...
Hanane Becha, Paola Flocchini
JCIT
2007
63views more  JCIT 2007»
15 years 6 months ago
Optimizing Reaching Definitions Overhead in Queue Processors
Queue computers are a viable option for embedded systems design. Queue computers feature a dense instruction set, high parallelism, low hardware complexity. In this paper we propo...
Yuki Nakanishi, Arquimedes Canedo, Ben A. Abderaze...
TSP
2008
94views more  TSP 2008»
15 years 6 months ago
Optimal Particle Filters for Tracking a Time-Varying Harmonic or Chirp Signal
We consider the problem of tracking the time-varying (TV) parameters of a harmonic or chirp signal using particle filtering (PF) tools. Similar to previous PF approaches to TV spec...
E. E. Tsakonas, Nicholas D. Sidiropoulos, Ananthra...