10899 search results - page 194 / 2180 » Wide Area Computation |
168
click to vote
CCCG
2004
15 years 8 months ago
2004
Given a set of n points in the plane, we show how to compute various enclosing isosceles triangles where different parameters such as area or perimeter are optimized. We then stud...
194
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
194
click to vote
HICSS
1994
IEEE
15 years 11 months ago
1994
IEEE
Meeting research and especially research on Computer Supported Meetings of natural teams is not available in abundance. What is reported of meetings often uses a rather limited th...
205
click to vote
DEDS
2002
15 years 6 months ago
2002
We propose an approach that integrates and extends known techniques from different areas to handle and analyze a complex and large system described as a network of synchronized com...
170
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
A report is provided for the ACM SIGKDD community about the 2010 Workshop on Algorithms for Modern Massive Data Sets (MMDS 2010), its origin in MMDS 2006 and MMDS 2008, and future...