Sciweavers

1040 search results - page 194 / 208
» Rounding algorithms for covering problems
Sort
View
WISE
2005
Springer
15 years 3 months ago
A Formal Ontology Reasoning with Individual Optimization: A Realization of the Semantic Web
Abstract. Answering a query over a group of RDF data pages is a trivial process. However, in the Semantic Web, there is a need for ontology technology. Consequently, OWL, a family ...
Pakornpong Pothipruk, Guido Governatori
COLT
1993
Springer
15 years 1 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...
JSAC
2008
140views more  JSAC 2008»
14 years 9 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
INFOCOM
2012
IEEE
13 years 1 days ago
FemtoCaching: Wireless video content delivery through distributed caching helpers
Abstract—We suggest a novel approach to handle the ongoing explosive increase in the demand for video content in wireless/mobile devices. We envision femtocell-like base stations...
Negin Golrezaei, Karthikeyan Shanmugam, Alexandros...
ISMB
2000
14 years 11 months ago
Analysis of Gene Expression Microarrays for Phenotype Classification
Several microarray technologies that monitor the level of expression of a large number of genes have recently emerged. Given DNA-microarray data for a set of cells characterized b...
Andrea Califano, Gustavo Stolovitzky, Yuhai Tu