Sciweavers

1433 search results - page 106 / 287
» On Covering Problems of Rado
Sort
View
ICML
2004
IEEE
16 years 7 months ago
A needle in a haystack: local one-class optimization
This paper addresses the problem of finding a small and coherent subset of points in a given data. This problem, sometimes referred to as one-class or set covering, requires to fi...
Koby Crammer, Gal Chechik
EDBT
2006
ACM
120views Database» more  EDBT 2006»
16 years 6 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
FOCS
2008
IEEE
16 years 24 days ago
Constant-Time Approximation Algorithms via Local Improvements
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...
Huy N. Nguyen, Krzysztof Onak
ESWS
2007
Springer
16 years 15 days ago
Semantic Composition of Lecture Subparts for a Personalized e-Learning
Abstract. In this paper we propose an algorithm for personalized learning based on a user’s query and a repository of lecture subparts —i.e., learning objects— both are descr...
Naouel Karam, Serge Linckels, Christoph Meinel
AINA
2006
IEEE
16 years 12 days ago
Clustering Protocol for Sensor Networks
In this paper we present Clustering Protocol (CP) for sensor networks. Clustering techniques are used by different protocols and applications to increase scalability and reduce de...
Arjan Durresi, Vamsi Paruchuri, Leonard Barolli