Sciweavers

4137 search results - page 528 / 828
» On the number of matchings of a tree
Sort
View
DCC
1995
IEEE
15 years 10 months ago
Accelerating Fractal Image Compression by Multi-Dimensional Nearest Neighbor Search
: In fractal image compression the encoding step is computationally expensive. A large number of sequential searches through a list of domains (portions of the image) are carried o...
Dietmar Saupe
WEBDB
2000
Springer
131views Database» more  WEBDB 2000»
15 years 10 months ago
Automatic Classification of Text Databases Through Query Probing
Many text databases on the web are "hidden" behind search interfaces, and their documents are only accessible through querying. Search engines typically ignore the conte...
Panagiotis G. Ipeirotis, Luis Gravano, Mehran Saha...
WSC
2007
15 years 9 months ago
Upgraded cellular automata based group-work interaction simulation
The simulation of group-work interaction is significant for Chinese enterprise organizational management. As a result, a cellular-automata based simulation model is put forward. T...
Dong Shengping, Hu Bin
CSB
2005
IEEE
132views Bioinformatics» more  CSB 2005»
15 years 8 months ago
A Fast Shotgun Assembly Heuristic
Genome sequencing opened a new era in genetics allowing the study of genomes at the nucleotide level. However, the chosen method of sequencing produced large numbers of nucleotide...
Christopher Wilks, Sami Khuri
COCOON
2008
Springer
15 years 8 months ago
On the Complexity of Equilibria Problems in Angel-Daemon Games
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...
Joaquim Gabarró, Alina García, Maria...