4435 search results - page 260 / 887 » Algorithms, games, and the internet |
171
click to vote
COMPSAC
2002
IEEE
15 years 11 months ago
2002
IEEE
Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompressio...
204
Voted
QOFIS
2000
Springer
15 years 10 months ago
2000
Springer
Many distributed multimedia applications have the ability to adapt to uctuations in the network conditions. By adjusting temporal and spatial quality to available bandwidth, or man...
173
click to vote
ICWS
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
138
click to vote
WEBI
2007
Springer
16 years 26 days ago
2007
Springer
Identification of distinct clusters of documents in text collections has traditionally been addressed by making the assumption that the data instances can only be represented by ...
191
click to vote
WEBI
2007
Springer
16 years 26 days ago
2007
Springer
Web sites are often organized into several regions, each dedicated to a specific topic or serving a particular function. From a user’s perspective, these regions typically form ...