Sciweavers

2356 search results - page 85 / 472
» Characterizations of postman sets
Sort
View
JCT
2011
84views more  JCT 2011»
14 years 11 months ago
Enumerating isodiametric and isoperimetric polygons
For a positive integer n that is not a power of 2, precisely the same family of convex polygons with n sides is optimal in three different geometric problems. These polygons have ...
Michael J. Mossinghoff
WWW
2011
ACM
14 years 11 months ago
Choreography conformance via synchronizability
Choreography analysis has been a crucial problem in service oriented computing. Interactions among services involve message exchanges across organizational boundaries in a distrib...
Samik Basu, Tevfik Bultan
WWW
2011
ACM
14 years 11 months ago
Analyzing and accelerating web access in a school in peri-urban India
While computers and Internet access have growing penetration amongst schools in the developing world, intermittent connectivity and limited bandwidth often prevent them from being...
Jay Chen, David Hutchful, William Thies, Lakshmina...
JMLR
2010
104views more  JMLR 2010»
14 years 11 months ago
Learnability, Stability and Uniform Convergence
The problem of characterizing learnability is the most basic question of statistical learning theory. A fundamental and long-standing answer, at least for the case of supervised c...
Shai Shalev-Shwartz, Ohad Shamir, Nathan Srebro, K...
CJ
2011
14 years 7 months ago
Dynamic Multipath Allocation in Ad Hoc Networks
Ad Hoc networks are characterized by fast dynamic changes in the topology of the network. A known technique to improve QoS is to use Multipath routing where packets (voice/video/ā...
Yosi Ben-Asher, Sharoni Feldman, Moran Feldman