Sciweavers

1418 search results - page 209 / 284
» Schema polynomials and applications
Sort
View
CORR
2010
Springer
167views Education» more  CORR 2010»
15 years 6 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...
TKDE
2008
178views more  TKDE 2008»
15 years 6 months ago
Efficient Similarity Search over Future Stream Time Series
With the advance of hardware and communication technologies, stream time series is gaining ever-increasing attention due to its importance in many applications such as financial da...
Xiang Lian, Lei Chen 0002
TSP
2008
117views more  TSP 2008»
15 years 6 months ago
A Theory for Sampling Signals From a Union of Subspaces
One of the fundamental assumptions in traditional sampling theorems is that the signals to be sampled come from a single vector space (e.g. bandlimited functions). However, in many...
Yue M. Lu, Minh N. Do
TCAD
2002
73views more  TCAD 2002»
15 years 6 months ago
System-on-a-chip test scheduling with precedence relationships, preemption, and power constraints
Test scheduling is an important problem in system-on-a-chip (SOC) test automation. Efficient test schedules minimize the overall system test application time, avoid test resource c...
Vikram Iyengar, Krishnendu Chakrabarty
ATMOS
2010
134views Optimization» more  ATMOS 2010»
15 years 5 months ago
Vertex Disjoint Paths for Dispatching in Railways
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
Holger Flier, Matús Mihalák, Anita S...