Sciweavers

725 search results - page 130 / 145
» Smoothed Analysis of Algorithms and Heuristics
Sort
View
TDP
2008
160views more  TDP 2008»
13 years 7 months ago
Enhanced P-Sensitive K-Anonymity Models for Privacy Preserving Data Publishing
Publishing data for analysis from a micro data table containing sensitive attributes, while maintaining individual privacy, is a problem of increasing significance today. The k-ano...
Xiaoxun Sun, Hua Wang, Jiuyong Li, Traian Marius T...
MST
2010
98views more  MST 2010»
13 years 5 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
CORR
2010
Springer
114views Education» more  CORR 2010»
13 years 5 months ago
Efficiently Discovering Hammock Paths from Induced Similarity Networks
ty networks are important abstractions in many information management applications such as recommender systems, corpora analysis, and medical informatics. For instance, in a recom...
M. Shahriar Hossain, Michael Narayan, Naren Ramakr...
CDC
2010
IEEE
111views Control Systems» more  CDC 2010»
13 years 2 months ago
Multi-robot monitoring in dynamic environments with guaranteed currency of observations
Abstract-- In this paper we consider the problem of monitoring a known set of stationary features (or locations of interest) in an environment. To observe a feature, a robot must v...
Stephen L. Smith, Daniela Rus
RTS
2011
176views more  RTS 2011»
12 years 10 months ago
Improved priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems
This paper is an extended version of a paper that appeared in the proceedings of the IEEE Real-Time Systems Symposium 2009. This paper has been updated with respect to advances ma...
Robert I. Davis, Alan Burns