Sciweavers

21324 search results - page 508 / 4265
» Making the case for computing
Sort
View
AIRS
2004
Springer
16 years 15 days ago
On Bit-Parallel Processing of Multi-byte Text
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...
Heikki Hyyrö, Jun Takaba, Ayumi Shinohara, Ma...
EAGC
2004
Springer
16 years 14 days ago
A Grid Service Framework for Metadata Management in Self-e-Learning Networks
Metadata management is critical for Grid systems. More specifically, semantically meaningful resource descriptions constitute a highly beneficial extension to Grid environments t...
George Samaras, Kyriakos Karenos, Eleni Christodou...
ACSC
2003
IEEE
16 years 11 days ago
Force-Transfer: A New Approach to Removing Overlapping Nodes in Graph Layout
Graphs where each node includes an amount of text are often used in applications. A typical example of such graphs is UML diagrams used in CASE tools. To make text information in ...
Xiaodi Huang, Wei Lai
SPAA
2003
ACM
16 years 10 days ago
Nonblocking k-compare-single-swap
The current literature offers two extremes of nonblocking software synchronization support for concurrent data structure design: intricate designs of specific structures based o...
Victor Luchangco, Mark Moir, Nir Shavit
DANCE
2002
IEEE
16 years 1 days ago
A Framework for Building Complex Netcentric Systems on Active Network
Active applications can add value to communication. Yet it involves sophisticated domain knowledge and complex development process. In this paper we discuss a framework for the co...
Javed I. Khan, Seung Su Yang