Sciweavers

3396 search results - page 416 / 680
» Tree representations of graphs
Sort
View
CORR
2010
Springer
145views Education» more  CORR 2010»
15 years 6 months ago
CAT-generation of ideals
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time...
Torsten Ueckerdt
WINET
2010
128views more  WINET 2010»
15 years 5 months ago
Distributed algorithms for lifetime maximization in sensor networks via Min-Max spanning subgraphs
We consider the problem of static transmission-power assignment for lifetime maximization of a wireless sensor network with stationary nodes operating in a data-gathering scenario...
Harri Haanpää, André Schumacher, ...
SODA
2012
ACM
225views Algorithms» more  SODA 2012»
13 years 9 months ago
Approximating rooted Steiner networks
The Directed Steiner Tree (DST) problem is a cornerstone problem in network design. We focus on the generalization of the problem with higher connectivity requirements. The proble...
Joseph Cheriyan, Bundit Laekhanukit, Guyslain Nave...
SG
2007
Springer
16 years 23 days ago
Semantic Information and Local Constraints for Parametric Parts in Interactive Virtual Construction
Abstract. This paper introduces a semantic representation for virtual prototyping in interactive virtual construction applications. The representation reflects semantic information...
Peter Biermann, Christian Fröhlich, Marc Eric...
PLILP
1997
Springer
15 years 10 months ago
Narrowing the Narrowing Space
We introduce a framework for managing as a whole the space of a narrowing computation. The aim of our framework is to find a finite representation of an infinite narrowing space...
Sergio Antoy, Zena M. Ariola