Sciweavers

11345 search results - page 1950 / 2269
» Foundations of Computer Science
Sort
View
161
Voted
HPDC
2010
IEEE
15 years 4 months ago
Towards optimising distributed data streaming graphs using parallel streams
Modern scientific collaborations have opened up the opportunity of solving complex problems that involve multidisciplinary expertise and large-scale computational experiments. The...
Chee Sun Liew, Malcolm P. Atkinson, Jano I. van He...
129
Voted
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
15 years 3 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
141
Voted
COMPUTER
2006
84views more  COMPUTER 2006»
15 years 3 months ago
Testable, Reusable Units of Cognition
The educational content of a technical topic consists, ultimately, of elementary chunks of knowledge. Identifying and classifying such units -- Testable, Reusable Units of Cogniti...
Bertrand Meyer
137
Voted
CGA
2007
15 years 3 months ago
From Abstract Painting to Information Visualization
abstract painting and practice can benefit information visualization—even though the two fields have significantly different objectives. This comparison reflects the spirit of ...
Kang Zhang
135
Voted
JAL
2006
114views more  JAL 2006»
15 years 3 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...
« Prev « First page 1950 / 2269 Last » Next »