2489 search results - page 67 / 498 » On the Subgroup Distance Problem |
121
Voted
ALT
2002
Springer
16 years 19 days ago
2002
Springer
Abstract. We consider a problem that is related to the “Universal Encoding Problem” from information theory. The basic goal is to find rules that map “partial information”...
134
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
— In recent years, issues regarding the behavior of TCP in high-speed and long-distance networks have been extensively addressed in the networking research community, both becaus...
130
Voted
JCO
1998
15 years 3 months ago
1998
Facility location problems have always been studied with the assumption that the edge lengths in the network are static and do not change over time. The underlyingnetwork could be ...
143
Voted
SIAMAM
2011
14 years 6 months ago
2011
In wireless networks, the channels are often subject to random variations that limit the reliability of communications between any two radios. Geographic transmission strategies ca...
110
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains w...