Sciweavers

5169 search results - page 733 / 1034
» Locality approximation using time
Sort
View
TSE
2002
133views more  TSE 2002»
15 years 4 months ago
Quality, Productivity, and Learning in Framework-Based Development: An Exploratory Case Study
This paper presents an empirical study in an industrial context on the production of software using a framework. Frameworks are semicomplete applications, usually implemented as a ...
Maurizio Morisio, Daniele Romano, Ioannis Stamelos
JASIS
2010
129views more  JASIS 2010»
15 years 3 months ago
Science overlay maps: A new tool for research policy and library management
We present a novel approach to visually locate bodies of research within the sciences, both at each moment of time and dynamically. This article describes how this approach fits w...
Ismael Rafols, Alan L. Porter, Loet Leydesdorff
EMNLP
2010
15 years 3 months ago
An Efficient Algorithm for Unsupervised Word Segmentation with Branching Entropy and MDL
This paper proposes a fast and simple unsupervised word segmentation algorithm that utilizes the local predictability of adjacent character sequences, while searching for a leaste...
Valentin Zhikov, Hiroya Takamura, Manabu Okumura
GLOBECOM
2010
IEEE
15 years 3 months ago
PRO: A Profile-Based Routing Protocol for Pocket Switched Networks
In this paper, we propose a novel routing protocol, PRO, for profile-based routing in pocket switched networks. Differing from previous routing protocols, PRO treats node encounter...
Murat Ali Bayir, Murat Demirbas
RECOMB
2010
Springer
15 years 2 months ago
Novel Definition and Algorithm for Chaining Fragments with Proportional Overlaps
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...
Raluca Uricaru, Alban Mancheron, Eric Rivals