Sciweavers

893 search results - page 48 / 179
» P3C: A New Algorithm for the Simple Temporal Problem
Sort
View
APWEB
2008
Springer
13 years 9 months ago
On the Complexity of Restricted k-anonymity Problem
Abstract. One of the emerging concepts in microdata protection is kanonymity, introduced by Samarati and Sweeney. k-anonymity provides a simple and efficient approach to protect pr...
Xiaoxun Sun, Hua Wang, Jiuyong Li
CPM
2005
Springer
116views Combinatorics» more  CPM 2005»
14 years 1 months ago
Exact and Approximation Algorithms for DNA Tag Set Design
In this paper we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formal...
Ion I. Mandoiu, Dragos Trinca
CVPR
2012
IEEE
11 years 10 months ago
Boosting algorithms for simultaneous feature extraction and selection
The problem of simultaneous feature extraction and selection, for classifier design, is considered. A new framework is proposed, based on boosting algorithms that can either 1) s...
Mohammad J. Saberian, Nuno Vasconcelos
AIPS
2009
13 years 8 months ago
Flexible Execution of Plans with Choice
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...
Patrick R. Conrad, Julie A. Shah, Brian C. William...
FOCM
2010
140views more  FOCM 2010»
13 years 6 months ago
Combinatorial Sublinear-Time Fourier Algorithms
We study the problem of estimating the best k term Fourier representation for a given frequency-sparse signal (i.e., vector) A of length N k. More explicitly, we investigate how t...
Mark A. Iwen