Sciweavers

578 search results - page 57 / 116
» The Minimum-Entropy Set Cover Problem
Sort
View
NPL
2008
68views more  NPL 2008»
13 years 8 months ago
On Nonparametric Residual Variance Estimation
In this paper, the problem of residual variance estimation is examined. The problem is analyzed in a general setting which covers non-additive heteroscedastic noise under non-iid s...
Elia Liitiäinen, Francesco Corona, Amaury Len...
AIPS
2008
13 years 11 months ago
Scheduling Meetings at Trade Events with Complex Preferences
We present a complex scheduling problem where we want to plan meetings between customers and exhibitors at a trade event. One cause of the complexity of the problem is the general...
Andreas Ernst, Gaurav Singh, René Weiskirch...
CPM
2010
Springer
120views Combinatorics» more  CPM 2010»
14 years 1 months ago
Mod/Resc Parsimony Inference
Abstract. We address in this paper a new computational biology problem that aims at understanding a mechanism that could potentially be used to genetically manipulate natural insec...
Igor Nor, Danny Hermelin, Sylvain Charlat, Jan Eng...
INFOCOM
2003
IEEE
14 years 2 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
TAMC
2007
Springer
14 years 3 months ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley