Sciweavers

774 search results - page 37 / 155
» Factors of generalized Fermat numbers
Sort
View
AICT
2006
IEEE
14 years 2 months ago
Optimal Solution of the Maximum All Request Path Grooming Problem
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
Jean-Claude Bermond, Michel Cosnard, David Coudert...
TIT
2010
130views Education» more  TIT 2010»
13 years 3 months ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao
ESA
2007
Springer
105views Algorithms» more  ESA 2007»
14 years 2 months ago
Non-clairvoyant Batch Sets Scheduling: Fairness Is Fair Enough
In real systems, such as operating systems, the scheduler is often unaware of the remaining work in each job or of the ability of the job to take advantage of more resources. In th...
Julien Robert, Nicolas Schabanel
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 8 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
BMCBI
2006
154views more  BMCBI 2006»
13 years 8 months ago
Analysis with respect to instrumental variables for the exploration of microarray data structures
Background: Evaluating the importance of the different sources of variations is essential in microarray data experiments. Complex experimental designs generally include various fa...
Florent Baty, Michaël Facompré, Jan Wi...