Sciweavers

211 search results - page 36 / 43
» How to present a paper in theoretical computer science: a sp...
Sort
View
STACS
1999
Springer
13 years 11 months ago
Costs of General Purpose Learning
Leo Harrington surprisingly constructed a machine which can learn any computable function f according to the following criterion (called Bc∗ -identification). His machine, on t...
John Case, Keh-Jiann Chen, Sanjay Jain
WG
2009
Springer
14 years 2 months ago
Sub-coloring and Hypo-coloring Interval Graphs
In this paper, we study the sub-coloring and hypo-coloring problems on interval graphs. These problems have applications in job scheduling and distributed computing and can be used...
Rajiv Gandhi, Bradford Greening, Sriram V. Pemmara...
CSE
2009
IEEE
14 years 2 months ago
Autonomous Management and Control of Sensor Network-Based Applications
—A central challenge facing sensor network research and development is the difficulty in providing effective autonomous management capability. This is due to a large number of p...
Antonio G. Ruzzelli, Conor Muldoon, Anthony Schoof...
FOCS
1995
IEEE
13 years 11 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
ACSC
2009
IEEE
14 years 2 months ago
Privacy-aware Access Control with Generalization Boundaries
Privacy is today an important concern for both data providers and data users. Data generalization can provide significant protection of an individual’s privacy, which means the...
Min Li, Hua Wang, Ashley W. Plank