14190 search results - page 2608 / 2838 » computing 2008 |
137
Voted
COCOON
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. We model a network in which messages spread by a simple directed graph G = (V, E) [1] and a function : V N mapping each v V to a positive integer less than or equal to...
128
Voted
COLT
2008
Springer
15 years 5 months ago
2008
Springer
We study the properties of the agnostic learning framework of Haussler [Hau92] and Kearns, Schapire and Sellie [KSS94]. In particular, we address the question: is there any situat...
130
click to vote
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We investigate the complexity of the outer face in arrangements of line segments of a fixed length in the plane, drawn uniformly at random within a square. We derive upper bounds ...
164
Voted
COMPGEOM
2008
ACM
15 years 5 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
124
Voted
COMPSAC
2008
IEEE
15 years 5 months ago
2008
IEEE
Service-oriented architecture (SOA) for distributed computing has become increasingly popular due to the great advantage that distributed applications can be rapidly synthesized w...