Sciweavers

2421 search results - page 73 / 485
» Approximate Flow-Aware Networking
Sort
View
IPL
2006
70views more  IPL 2006»
14 years 10 months ago
A polynomial time approximation scheme for embedding a directed hypergraph on a ring
We study the problem of embedding a directed hypergraph on a ring that has applications in optical network communications. The undirected version (MCHEC) has been extensively stud...
Kang Li, Lusheng Wang
CORR
2010
Springer
148views Education» more  CORR 2010»
14 years 10 months ago
Approximability of the Multiple Stack TSP
STSP seeks a pair of pickup and delivery tours in two distinct networks, where the two tours are related by LIFO contraints. We address here the problem approximability. We notabl...
Sophie Toulouse
ASUNAM
2011
IEEE
13 years 10 months ago
Probabilistic Subgraph Matching on Huge Social Networks
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
PERCOM
2010
ACM
14 years 8 months ago
Crowd-sourcing world models with OpenRoomMap
Abstract—The construction of world models typically requires laborious survey and cataloguing of a building’s contents. OpenRoomMap attempts to crowd-source this information by...
Andrew Colin Rice, Oliver J. Woodman
WAOA
2010
Springer
239views Algorithms» more  WAOA 2010»
14 years 7 months ago
Strategic Multiway Cut and Multicut Games
We consider cut games where players want to cut themselves off from different parts of a network. These games arise when players want to secure themselves from areas of potential i...
Elliot Anshelevich, Bugra Caskurlu, Ameya Hate