Sciweavers

CORR
2004
Springer
218views Education» more  CORR 2004»
13 years 5 months ago
A Dynamic Clustering-Based Markov Model for Web Usage Mining
Markov models have been widely utilized for modelling user web navigation behaviour. In this work we propose a dynamic clustering-based method to increase a Markov model's ac...
José Borges, Mark Levene
CORR
2004
Springer
86views Education» more  CORR 2004»
13 years 5 months ago
Mapping Topics and Topic Bursts in PNAS
Ketan Mane, Katy Börner
CORR
2004
Springer
83views Education» more  CORR 2004»
13 years 5 months ago
INSPIRE: Evaluation of a Smart-Home System for Infotainment Management and Device Control
This paper gives an overview of the assessment and evaluation methods which have been used to determine the quality of the INSPIRE smart home system. The system allows different h...
Sebastian Möller, Jan Krebber, Alexander Raak...
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 5 months ago
Towards a Model-Based Framework for Integrating Usability and Software Engineering Life Cycles
: In this position paper we propose a process model that provides a development infrastructure in which the usability engineering and software engineering life cycles co-exist in c...
Pardha S. Pyla, Manuel A. Pérez-Quiñ...
CORR
2004
Springer
105views Education» more  CORR 2004»
13 years 5 months ago
An Approximation Algorithm for Stackelberg Network Pricing
Sébastien Roch, Patrice Marcotte, Gilles Sa...
CORR
2004
Springer
104views Education» more  CORR 2004»
13 years 5 months ago
Near Rationality and Competitive Equilibria in Networked Systems
A growing body of literature in networked systems research relies on game theory and mechanism design to model and address the potential lack of cooperation between self-intereste...
Nicolas Christin, Jens Grossklags, John Chuang
CORR
2004
Springer
121views Education» more  CORR 2004»
13 years 5 months ago
Worst-Case Optimal Tree Layout in a Memory Hierarchy
Consider laying out a fixed-topology tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse ...
Erik D. Demaine, John Iacono, Stefan Langerman
CORR
2004
Springer
75views Education» more  CORR 2004»
13 years 5 months ago
Locally connected spanning trees on graphs
A locally connected spanning tree of a graph G is a spanning tree T of G such that the set of all neighbors of v in T induces a connected subgraph of G for every v V (G). The pur...
Ching-Chi Lin, Gerard J. Chang, Gen-Huey Chen
CORR
2004
Springer
107views Education» more  CORR 2004»
13 years 5 months ago
The Computational Complexity of Orientation Search Problems in Cryo-Electron Microscopy
Taneli Mielikäinen, Janne Ravantti, Esko Ukko...