Sciweavers

16430 search results - page 70 / 3286
» On Computable Tree Functions
Sort
View
LCN
2006
IEEE
14 years 4 months ago
Computing Real Time Jobs in P2P Networks
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
Jingnan Yao, Jian Zhou, Laxmi N. Bhuyan
MM
2003
ACM
132views Multimedia» more  MM 2003»
14 years 3 months ago
A flexible and scalable authentication scheme for JPEG2000 image codestreams
JPEG2000 is an emerging standard for still image compression and is becoming the solution of choice for many digital imaging fields and applications. An important aspect of JPEG2...
Cheng Peng, Robert H. Deng, Yongdong Wu, Weizhong ...
JCB
2008
122views more  JCB 2008»
13 years 10 months ago
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
Enno Ohlebusch, Stefan Kurtz
COLING
2002
13 years 10 months ago
Generating the XTAG English Grammar Using Metarules
We discuss a grammar development process used to generate the trees of the wide-coverage Lexicalized Tree Adjoining Grammar (LTAG) for English of the XTAG Project. Result of the c...
Carlos A. Prolo
CPM
2007
Springer
134views Combinatorics» more  CPM 2007»
14 years 2 months ago
Efficient Computation of Substring Equivalence Classes with Suffix Arrays
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai,...