Sciweavers

7840 search results - page 217 / 1568
» On generalized Ramsey numbers
Sort
View
SIROCCO
2003
15 years 8 months ago
The Cost of Concurrent, Low-Contention Read-Modify-Write
In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify...
Costas Busch, Marios Mavronicolas, Paul G. Spiraki...
JSAC
2006
107views more  JSAC 2006»
15 years 6 months ago
Adaptive Sensor Activity Control in Many-to-One Sensor Networks
Abstract--In this paper, we consider a many-to-one sensor network where a large number of sensors are deployed to monitor a physical environment. We explore sensor activity managem...
Zhifeng Hu, Junshan Zhang, Lang Tong
CIKM
2009
Springer
16 years 1 months ago
POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice
Data generalization is widely used to protect identities and prevent inference of sensitive information during the public release of microdata. The k-anonymity model has been exte...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
JMLR
2002
137views more  JMLR 2002»
15 years 6 months ago
The Subspace Information Criterion for Infinite Dimensional Hypothesis Spaces
A central problem in learning is selection of an appropriate model. This is typically done by estimating the unknown generalization errors of a set of models to be selected from a...
Masashi Sugiyama, Klaus-Robert Müller
FOCS
2009
IEEE
16 years 1 months ago
Approximation Algorithms for Multicommodity-Type Problems with Guarantees Independent of the Graph Size
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
Ankur Moitra