Sciweavers

4913 search results - page 167 / 983
» Results and Perspectives of the G
Sort
View
JACM
2007
121views more  JACM 2007»
15 years 6 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
ICIP
2001
IEEE
16 years 8 months ago
A new basis selection paradigm for wavelet packet image coding
In this paper, work on a new wavelet packet basis selection paradigm is reported which emphasizes the crucial role of quantization strategy being used. This paradigm is coupled wi...
François G. Meyer, Nasir Rajpoot, Roland G....
PKDD
2005
Springer
105views Data Mining» more  PKDD 2005»
16 years 19 hour ago
Protein Sequence Pattern Mining with Constraints
Considering the characteristics of biological sequence databases, which typically have a small alphabet, a very long length and a relative small size (several hundreds of sequences...
Pedro Gabriel Ferreira, Paulo J. Azevedo
BIRTHDAY
1999
Springer
15 years 10 months ago
An Insertion into the Chomsky Hierarchy?
This review paper will report on some recent discoveries in the area of Formal Languages, chie y by F. Otto, G. Buntrock and G. Niemann. These discoveries have pointed out certain ...
Robert McNaughton
SRDS
1998
IEEE
15 years 10 months ago
Practical Parallel Algorithms for Minimum Spanning Trees
We study parallel algorithms for computing the minimum spanning tree of a weighted undirected graph G with n vertices and m edges. We consider an input graph G with m=n p, where p...
Frank K. H. A. Dehne, Silvia Götz