Sciweavers

13603 search results - page 249 / 2721
» On the Complexity of Computing Treelength
Sort
View
CHI
2010
ACM
16 years 22 days ago
Understanding usability practices in complex domains
Although usability methods are widely used for evaluating conventional graphical user interfaces and websites, there is a growing concern that current approaches are inadequate fo...
Parmit K. Chilana, Jacob O. Wobbrock, Andrew J. Ko
ASAP
2007
IEEE
107views Hardware» more  ASAP 2007»
16 years 7 days ago
A Hardware-Oriented Method for Evaluating Complex Polynomials
A hardware-oriented method for evaluating complex polynomials by solving iteratively a system of linear equations is proposed. Its implementation uses a digit-serial iterations on...
Milos D. Ercegovac, Jean-Michel Muller
CCGRID
2003
IEEE
15 years 11 months ago
Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems"
— Due to enormous complexity of the unstructured peer-to-peer networks as large-scale, self-configure, and dynamic systems, the models used to characterize these systems are eit...
Farnoush Banaei Kashani, Cyrus Shahabi
ICCS
2007
Springer
16 years 1 days ago
Towards a Complex Automata Framework for Multi-scale Modeling: Formalism and the Scale Separation Map
Complex Automata were recently proposed as a paradigm to model multi-scale complex systems. The concept is formalized and the scale separation map is further investigated in relati...
Alfons G. Hoekstra, Eric Lorenz, Jean-Luc Falcone,...
COMPGEOM
2010
ACM
15 years 11 months ago
Better bounds on the union complexity of locally fat objects
We prove that the union complexity of a set of n constantcomplexity locally fat objects (which can be curved and/or non-convex) in the plane is O(λt+2(n) log n), where t is the m...
Mark de Berg