Sciweavers

3299 search results - page 366 / 660
» A general mathematics of names
Sort
View
PODC
2011
ACM
14 years 9 months ago
MIS on trees
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
Christoph Lenzen, Roger Wattenhofer
SIGMOD
2011
ACM
221views Database» more  SIGMOD 2011»
14 years 9 months ago
Scalable query rewriting: a graph-based approach
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
George Konstantinidis, José Luis Ambite
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...
ICCV
2011
IEEE
14 years 6 months ago
Means in spaces of tree-like shapes
The mean is often the most important statistic of a dataset as it provides a single point that summarizes the entire set. While the mean is readily defined and computed in Euclid...
Aasa Feragen, Søren Hauberg, Mads Nielsen, Franç...
ISPD
2012
ACM
252views Hardware» more  ISPD 2012»
14 years 2 months ago
Towards layout-friendly high-level synthesis
There are two prominent problems with technology scaling: increasing design complexity and more challenges with interconnect design, including routability. High-level synthesis ha...
Jason Cong, Bin Liu 0006, Guojie Luo, Raghu Prabha...