Sciweavers

51692 search results - page 10128 / 10339
» at 2008
Sort
View
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
15 years 8 months ago
Santa Claus Meets Hypergraph Matchings
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
Arash Asadpour, Uriel Feige, Amin Saberi
APPROX
2008
Springer
184views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximately Counting Embeddings into Random Graphs
Let H be a graph, and let CH(G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating CH(G). Previous res...
Martin Fürer, Shiva Prasad Kasiviswanathan
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov
APSCC
2008
IEEE
15 years 8 months ago
ABSRP- A Service Discovery Approach for Vehicular Ad Hoc Networks
A vehicular ad-hoc network (VANET) is a network of intelligent vehicles that communicate with other vehicles in the network. The main objective of VANET is to provide comfort and ...
Brijesh Kadri Mohandas, Amiya Nayak, Kshirasagar N...
ARC
2008
Springer
95views Hardware» more  ARC 2008»
15 years 8 months ago
The Instruction-Set Extension Problem: A Survey
Over the last years, we have witnessed the increased use of Application-Specific Instruction-Set Processors (ASIPs). These ASIPs are processors that have a customizable instruction...
Carlo Galuzzi, Koen Bertels
« Prev « First page 10128 / 10339 Last » Next »