Sciweavers

607 search results - page 17 / 122
» Unifying Exact Completions
Sort
View
KBSE
2009
IEEE
15 years 5 months ago
Code Completion from Abbreviated Input
—Abbreviation Completion is a novel technique to improve the efficiency of code-writing by supporting code completion of multiple keywords based on non-predefined abbreviated inp...
Sangmok Han, David R. Wallace, Robert C. Miller
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 5 months ago
Robust Matrix Completion with Corrupted Columns
This paper considers the problem of matrix completion, when some number of the columns are arbitrarily corrupted, potentially by a malicious adversary. It is well-known that stand...
Yudong Chen, Huan Xu, Constantine Caramanis, Sujay...
GD
1998
Springer
15 years 2 months ago
Geometric Thickness of Complete Graphs
We define the geometric thickness of a graph to be the smallest number of layers such that we can draw the graph in the plane with straightline edges and assign each edge to a lay...
Michael B. Dillencourt, David Eppstein, Daniel S. ...
ICASSP
2010
IEEE
14 years 11 months ago
Collaborative spectrum sensing from sparse observations using matrix completion for cognitive radio networks
— In cognitive radio, spectrum sensing is a key component to detect spectrum holes (i.e., channels not used by any primary users). Collaborative spectrum sensing among the cognit...
Jia Meng, Wotao Yin, Husheng Li, Ekram Hossain, Zh...
DM
1998
68views more  DM 1998»
14 years 10 months ago
Alternating cycles and trails in 2-edge-coloured complete multigraphs
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
Jørgen Bang-Jensen, Gregory Gutin