Sciweavers

7106 search results - page 1164 / 1422
» Restricted Complexity, General Complexity
Sort
View
PLDI
2011
ACM
14 years 9 months ago
Data representation synthesis
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
SAC
2011
ACM
14 years 9 months ago
A semantically rich approach for collaborative model edition
We propose a novel approach and tool for collaborative software engineering and development. In model-based software engineering, the underlying data structure is a complex, direc...
Jonathan Michaux, Xavier Blanc, Marc Shapiro, Pier...
SIGMOD
2011
ACM
230views Database» more  SIGMOD 2011»
14 years 9 months ago
GBLENDER: visual subgraph query formulation meets query processing
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, By...
ICCV
2011
IEEE
14 years 6 months ago
A Nonparametric Riemannian Framework on Tensor Field with Application to Foreground Segmentation
Background modelling on tensor field has recently been proposed for foreground detection tasks. Taking into account the Riemannian structure of the tensor manifold, recent resear...
Rui Caseiro, João F. Henriques, Pedro Martins, Jo...
ALT
2011
Springer
14 years 6 months ago
On Noise-Tolerant Learning of Sparse Parities and Related Problems
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
Elena Grigorescu, Lev Reyzin, Santosh Vempala
« Prev « First page 1164 / 1422 Last » Next »