Sciweavers

1424 search results - page 96 / 285
» The Multi-radius Cover Problem
Sort
View
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
15 years 5 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
INFOCOM
2003
IEEE
15 years 8 months ago
Robust Monitoring of Link Delays and Faults in IP Networks
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
Yigal Bejerano, Rajeev Rastogi
ICCBR
2003
Springer
15 years 8 months ago
Index Driven Selective Sampling for CBR
In real environments it is often difficult to obtain a collection of cases for the case base that would cover all the problem solving situations. Although it is often somewhat eas...
Nirmalie Wiratunga, Susan Craw, Stewart Massie
ICML
2004
IEEE
16 years 3 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 3 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...