Sciweavers

4451 search results - page 298 / 891
» On Random Ordering Constraints
Sort
View
JMLR
2012
13 years 9 months ago
A General Framework for Structured Sparsity via Proximal Optimization
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
Luca Baldassarre, Jean Morales, Andreas Argyriou, ...
TIME
1994
IEEE
15 years 10 months ago
Localized Temporal Reasoning: A State-Based Approach
We are concerned with temporalreasoning problems where there is uncertainty about the order in which events occur. The task of temporal reasoning is to derive an event sequence co...
Shieu-Hong Lin, Thomas Dean
PRICAI
2004
Springer
16 years 1 days ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
16 years 7 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
GLOBECOM
2009
IEEE
16 years 1 months ago
Capacity Gains of Some Frequency Reuse Schemes in OFDMA Networks
—The downlink capacity of cellular networks is known to be strongly limited by inter-cell interference. In order to mitigate this interference, a number of frequency reuse scheme...
Thomas Bonald, Nidhi Hegde