Sciweavers

16218 search results - page 305 / 3244
» Standards
Sort
View
ORL
2011
15 years 1 months ago
Convex approximations to sparse PCA via Lagrangian duality
We derive a convex relaxation for cardinality constrained Principal Component Analysis (PCA) by using a simple representation of the L1 unit ball and standard Lagrangian duality. ...
Ronny Luss, Marc Teboulle
ICASSP
2011
IEEE
14 years 10 months ago
Scheduling of CAL actor networks based on dynamic code analysis
CAL is a dataflow oriented language for writing high-level specifications of signal processing applications. The language has recently been standardized and selected for the new...
Jani Boutellier, Olli Silvén, Mickaël ...
SCIA
2011
Springer
216views Image Analysis» more  SCIA 2011»
14 years 9 months ago
Triangulating a Plane
Abstract. In this theoretical paper we consider the problem of accurately triangulating a scene plane. Rather than first triangulating a set of points and then fitting a plane to...
Carl Olsson, Anders Eriksson
179
Voted
PODS
2007
ACM
109views Database» more  PODS 2007»
16 years 6 months ago
What is "next" in event processing?
Event processing systems have wide applications ranging from managing events from RFID readers to monitoring RSS feeds. Consequently, there exists much work on them in the literat...
Walker M. White, Mirek Riedewald, Johannes Gehrke,...
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
16 years 4 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau