Sciweavers

12257 search results - page 2070 / 2452
» Analysis of Algorithms
Sort
View
WWW
2004
ACM
16 years 5 months ago
Remindin': semantic query routing in peer-to-peer networks based on social metaphors
In peer-to-peer networks, finding the appropriate answer for an information request, such as the answer to a query for RDF(S) data, depends on selecting the right peer in the netw...
Christoph Tempich, Steffen Staab, Adrian Wranik
WWW
2004
ACM
16 years 5 months ago
Towards a flash search engine based on expressive semantics
Flash, as a multimedia format, becomes more and more popular on the Web. However, previous works on Flash are totally based on low-level features, which make it unpractical to bui...
Dawei Ding, Jun Yang 0003, Liping Wang, Qing Li, W...
WWW
2004
ACM
16 years 5 months ago
Graph-based text database for knowledge discovery
While we expect to discover knowledge in the texts available on the Web, such discovery usually requires many complex analysis steps, most of which require different text handling...
Junji Tomita, Hidekazu Nakawatase, Megumi Ishii
ASPLOS
2009
ACM
16 years 5 months ago
QR decomposition on GPUs
QR decomposition is a computationally intensive linear algebra operation that factors a matrix A into the product of a unitary matrix Q and upper triangular matrix R. Adaptive sys...
Andrew Kerr, Dan Campbell, Mark Richards
247
Voted
CP
2009
Springer
16 years 5 months ago
The Complexity of Valued Constraint Models
The Valued Constraint Satisfaction Problem (VCSP) is a general framework encompassing many optimisation problems. We discuss precisely what it means for a problem to be modelled in...
Peter G. Jeavons, Stanislav Zivný
« Prev « First page 2070 / 2452 Last » Next »