Sciweavers

701 search results - page 91 / 141
» Kolmogorov complexity in perspective
Sort
View
HICSS
1994
IEEE
141views Biometrics» more  HICSS 1994»
13 years 11 months ago
Empirical CATeam Research in Meetings
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...
Helmut Krcmar, Henrik Lewe, Gerhard Schwabe
BMCBI
2007
111views more  BMCBI 2007»
13 years 7 months ago
Modular co-evolution of metabolic networks
Background: The architecture of biological networks has been reported to exhibit high level of modularity, and to some extent, topological modules of networks overlap with known f...
Jing Zhao, Guohui Ding, Lin Tao, Hong Yu, Zhong-Ha...
COMCOM
2007
84views more  COMCOM 2007»
13 years 7 months ago
A user-focused evaluation of web prefetching algorithms
Web prefetching mechanisms have been proposed to benefit web users by hiding the download latencies. Nevertheless, to the knowledge of the authors, there is no attempt to compare...
Josep Domènech, Ana Pont, Julio Sahuquillo,...
IEEEPACT
2006
IEEE
14 years 1 months ago
Complexity-based program phase analysis and classification
Modeling and analysis of program behavior are at the foundation of computer system design and optimization. As computer systems become more adaptive, their efficiency increasingly...
Chang-Burm Cho, Tao Li
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
13 years 9 months ago
Trade-Off Lower Bounds for Stack Machines
—A space bounded Stack Machine is a regular Turing Machine with a read-only input tape, several space bounded read-write work tapes, and an unbounded stack. Stack Machines with a...
Matei David, Periklis A. Papakonstantinou