Sciweavers

4526 search results - page 642 / 906
» Algorithmic problems related to the Internet
Sort
View
DM
1999
145views more  DM 1999»
15 years 4 months ago
Modular decomposition and transitive orientation
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
Ross M. McConnell, Jeremy Spinrad
CVPR
2011
IEEE
15 years 25 days ago
Online Group-Structured Dictionary Learning
We develop a dictionary learning method which is (i) online, (ii) enables overlapping group structures with (iii) non-convex sparsity-inducing regularization and (iv) handles the ...
Zoltan Szabo, Barnabas Poczos, Andras Lorincz
ECCC
2011
185views ECommerce» more  ECCC 2011»
14 years 11 months ago
Property Testing Lower Bounds via Communication Complexity
We develop a new technique for proving lower bounds in property testing, by showing a strong connection between testing and communication complexity. We give a simple scheme for r...
Eric Blais, Joshua Brody, Kevin Matulef
169
Voted
ICASSP
2011
IEEE
14 years 8 months ago
Weighted and structured sparse total least-squares for perturbed compressive sampling
Solving linear regression problems based on the total least-squares (TLS) criterion has well-documented merits in various applications, where perturbations appear both in the data...
Hao Zhu, Georgios B. Giannakis, Geert Leus

Publication
233views
14 years 3 months ago
Sparse reward processes
We introduce a class of learning problems where the agent is presented with a series of tasks. Intuitively, if there is relation among those tasks, then the information gained duri...
Christos Dimitrakakis