Sciweavers

DISOPT
2006
101views more  DISOPT 2006»
13 years 9 months ago
Greedy-type resistance of combinatorial problems
This paper gives a sufficient condition for a combinatorial problem to be greedy-type-resistant, i.e. such that, on some instances of the problem, any greedy-type algorithm will o...
Gareth Bendall, François Margot
AUTOMATICA
2006
66views more  AUTOMATICA 2006»
13 years 9 months ago
Stability of a rate control system with averaged feedback and network delay
We study the stability of a variant of Kelly's rate control scheme in a simple setting with a single flow and a single resource. The feedback signal from the resource is a fun...
Richard J. La, Priya Ranjan
APAL
2006
73views more  APAL 2006»
13 years 9 months ago
Compactness in locales and in formal topology
If a locale is presented by a "flat site", it is shown how its frame can be presented by generators and relations as a dcpo. A necessary and sufficient condition is deri...
Steven J. Vickers
CORR
2010
Springer
172views Education» more  CORR 2010»
13 years 9 months ago
The MUSIC Algorithm for Sparse Objects: A Compressed Sensing Analysis
The MUSIC algorithm, and its extension for imaging sparse extended objects, with noisy data is analyzed by compressed sensing (CS) techniques. A thresholding rule is developed to a...
Albert Fannjiang
CORR
2010
Springer
68views Education» more  CORR 2010»
13 years 9 months ago
Polymatroids with Network Coding
Abstract--The problem of network coding for multicasting a single source to multiple sinks has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they have establi...
Te Sun Han
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 9 months ago
Reconstruction of complete interval tournaments
Let a, b and n be nonnegative integers (b a, b > 0, n 1), Gn(a, b) be a multigraph on n vertices in which any pair of vertices is connected with at least a and at most b edges ...
Antal Iványi
APPML
2010
91views more  APPML 2010»
13 years 9 months ago
Certificates of convexity for basic semi-algebraic sets
We provide two certificates of convexity for arbitrary basic closed semi-algebraic sets of Rn. The first one is based on a necessary and sufficient condition whereas the second one...
Jean B. Lasserre
NIPS
2008
13 years 10 months ago
Resolution Limits of Sparse Coding in High Dimensions
This paper addresses the problem of sparsity pattern detection for unknown ksparse n-dimensional signals observed through m noisy, random linear measurements. Sparsity pattern rec...
Alyson K. Fletcher, Sundeep Rangan, Vivek K. Goyal
COCOON
2008
Springer
13 years 11 months ago
A Linear Programming Duality Approach to Analyzing Strictly Nonblocking d-ary Multilog Networks under General Crosstalk Constrai
When a switching network topology is used for constructing optical cross-connects, as in the circuit switching case, no two routes are allowed to share a link. However, if two rou...
Hung Q. Ngo, Yang Wang 0014, Anh Le
ICRA
2003
IEEE
87views Robotics» more  ICRA 2003»
14 years 2 months ago
A new algorithm for three-finger force-closure grasp of polygonal objects
—We prove a new necessary and sufficient condition for 2D three-finger equilibrium grasps and implement a geometrical algorithm for computing force-closure grasps of polygonal ob...
Jia-Wei Li, Ming-He Jin, Hong Liu