Sciweavers

6045 search results - page 1147 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
GLOBECOM
2008
IEEE
13 years 8 months ago
Power Efficient Throughput Maximization in Multi-Hop Wireless Networks
Abstract-- We study the problem of total throughput maximization in arbitrary multi-hop wireless networks, with constraints on the total power usage (denoted by PETM), when nodes h...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
AHSWN
2010
102views more  AHSWN 2010»
13 years 8 months ago
A Framework for the Capacity Evaluation of Multihop Wireless Networks?
The specific challenges of multihop wireles networks lead to a strong research effort on efficient protocols design where the offered capacity is a key objective. More specifically...
Hervé Rivano, Fabrice Theoleyre, Fabrice Va...
ALGORITHMICA
2008
111views more  ALGORITHMICA 2008»
13 years 8 months ago
Fixed-Parameter Complexity of Minimum Profile Problems
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
Gregory Gutin, Stefan Szeider, Anders Yeo
APPML
2007
92views more  APPML 2007»
13 years 8 months ago
Topological grammars for data approximation
A method of topological grammars is proposed for multidimensional data approximation. For data with complex topology we define a principal cubic complex of low dimension and give...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...
CAGD
2010
151views more  CAGD 2010»
13 years 8 months ago
On the complexity of smooth spline surfaces from quad meshes
This paper derives strong relations that boundary curves of a smooth complex of patches have to obey when the patches are computed by local averaging. These relations restrict the...
Jörg Peters, Jianhua Fan
« Prev « First page 1147 / 1209 Last » Next »