Sciweavers

28888 search results - page 32 / 5778
» Computability and complexity in analysis
Sort
View
APCHI
2004
IEEE
13 years 11 months ago
Designing for Flow in a Complex Activity
One component of a user's interaction with computer systems is commonly referred to as `flow'. Flow is an important consideration in interactive system design as it enca...
Jon M. Pearce, Steve Howard
CLUSTER
2002
IEEE
13 years 7 months ago
ZENTURIO: An Experiment Management System for Cluster and Grid Computing
The need to conduct and manage large sets of experiments for scientific applications dramatically increased over the last decade. However, there is still very little tool support ...
Radu Prodan, Thomas Fahringer
CONPAR
1992
13 years 12 months ago
Cost Prediction for Load Balancing: Application to Algebraic Computations
A major feature of Computer Algebra, and more generally of non-numerical computations, is the dynamical and non-predictable behaviour of the executions. We then understand that st...
Jean-Louis Roch, A. Vermeerbergen, Gilles Villard
IDA
2009
Springer
14 years 12 days ago
Distributed Algorithm for Computing Formal Concepts Using Map-Reduce Framework
Searching for interesting patterns in binary matrices plays an important role in data mining and, in particular, in formal concept analysis and related disciplines. Several algorit...
Petr Krajca, Vilém Vychodil
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
14 years 1 months ago
Communication complexity of common voting rules
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
Vincent Conitzer, Tuomas Sandholm