Sciweavers

14642 search results - page 2390 / 2929
» It's Time for a Change
Sort
View
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
16 years 1 months ago
Pricing Tree Access Networks with Connected Backbones
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. R...
ESA
2007
Springer
118views Algorithms» more  ESA 2007»
16 years 1 months ago
A New ILP Formulation for 2-Root-Connected Prize-Collecting Steiner Networks
We consider the real-world problem of extending a given infrastructure network in order to connect new customers. By representing the infrastructure by a single root node, this pro...
Markus Chimani, Maria Kandyba, Petra Mutzel
ESAS
2007
Springer
16 years 1 months ago
ALGSICS - Combining Physics and Cryptography to Enhance Security and Privacy in RFID Systems
RFID-tags can be seen as a new generation of bar codes with added functionality. They are becoming very popular tools for identification of products in various applications such a...
Neil Bird, Claudine Conrado, Jorge Guajardo, Stefa...
FPGA
2007
ACM
119views FPGA» more  FPGA 2007»
16 years 1 months ago
Synthesis of an application-specific soft multiprocessor system
The application-specific multiprocessor System-on-a-Chip is a promising design alternative because of its high degree of flexibility, short development time, and potentially high ...
Jason Cong, Guoling Han, Wei Jiang
FSTTCS
2007
Springer
16 years 1 months ago
Better Algorithms and Bounds for Directed Maximum Leaf Problems
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this pa...
Noga Alon, Fedor V. Fomin, Gregory Gutin, Michael ...
« Prev « First page 2390 / 2929 Last » Next »