Sciweavers

15485 search results - page 2513 / 3097
» Computing Optimal Subsets
Sort
View
MOBIDE
2010
ACM
15 years 7 months ago
Minimum-hot-spot query trees for wireless sensor networks
We propose a distributed algorithm to construct a balanced communication tree that serves in gathering data from the network nodes to a sink. Our algorithm constructs a near-optim...
Georgios Chatzimilioudis, Demetrios Zeinalipour-Ya...
EUROPAR
2010
Springer
15 years 7 months ago
Power-Efficient Spilling Techniques for Chip Multiprocessors
Abstract. Current trends in CMPs indicate that the core count will increase in the near future. One of the main performance limiters of these forthcoming microarchitectures is the ...
Enric Herrero, José González, Ramon ...
ALGORITHMICA
2007
145views more  ALGORITHMICA 2007»
15 years 7 months ago
Counting Integer Points in Parametric Polytopes Using Barvinok's Rational Functions
Abstract Many compiler optimization techniques depend on the ability to calculate the number of elements that satisfy certain conditions. If these conditions can be represented by ...
Sven Verdoolaege, Rachid Seghir, Kristof Beyls, Vi...
AUTOMATICA
2008
116views more  AUTOMATICA 2008»
15 years 7 months ago
A dynamical systems approach to weighted graph matching
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
Michael M. Zavlanos, George J. Pappas
CGF
2008
103views more  CGF 2008»
15 years 7 months ago
An Example-based Procedural System for Element Arrangement
We present a method for synthesizing two dimensional (2D) element arrangements from an example. The main idea is to combine texture synthesis techniques based-on a local neighborh...
Takashi Ijiri, Radomír Mech, Takeo Igarashi...
« Prev « First page 2513 / 3097 Last » Next »