2107 search results - page 121 / 422 » Computing Small Search Numbers in Linear Time |
113
click to vote
LAWEB
2005
IEEE
15 years 9 months ago
2005
IEEE
With the technology advance and the growth of Internet, the information that can be found in this net, as well as the number of users that access to look for specific data is big...
131
Voted
IPSN
2005
Springer
15 years 9 months ago
2005
Springer
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
120
Voted
GFKL
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Existing methods to text plagiarism analysis mainly base on “chunking”, a process of grouping a text into meaningful units each of which gets encoded by an integer nu...
121
Voted
CONIELECOMP
2005
IEEE
15 years 9 months ago
2005
IEEE
The approximate searching problem on compressed text tries to find all the matches of a pattern in a compressed text, without decompressing it and considering that the match of th...
121
Voted
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
The computational power needed for searching exponentially growing databases, such as GenBank, has increased dramatically. Three different implementations of the most widely used ...