Sciweavers

9997 search results - page 1644 / 2000
» The case for crowd computing
Sort
View
199
Voted
CORR
2007
Springer
167views Education» more  CORR 2007»
15 years 6 months ago
Optimal Solutions for Sparse Principal Component Analysis
Given a sample covariance matrix, we examine the problem of maximizing the variance explained by a linear combination of the input variables while constraining the number of nonze...
Alexandre d'Aspremont, Francis R. Bach, Laurent El...
JCT
2008
84views more  JCT 2008»
15 years 6 months ago
Minimally non-Pfaffian graphs
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sha...
Serguei Norine, Robin Thomas
IPL
2006
89views more  IPL 2006»
15 years 6 months ago
Adaptive general perfectly periodic scheduling
We propose an adaptive algorithm Adaptmin to create perfectly periodic schedules. A perfectly periodic schedule schedules a client regularly after a predefined amount of time known...
Shailesh Patil, Vijay K. Garg
JEI
2008
93views more  JEI 2008»
15 years 6 months ago
Novel workflow for image-guided gamut mapping
We introduce a novel workflow that will hopefully open new directions of processing and improvement in image reproduction. Existing gamut mapping algorithms can be classified into ...
Asaf Golan, Hagit Hel-Or
CORR
2007
Springer
47views Education» more  CORR 2007»
15 years 6 months ago
Data Structures for Mergeable Trees
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
Loukas Georgiadis, Haim Kaplan, Nira Shafrir, Robe...
« Prev « First page 1644 / 2000 Last » Next »