3575 search results - page 196 / 715 » Structured motifs search |
157
click to vote
ICDCS
2005
IEEE
16 years 7 days ago
2005
IEEE
We consider the problem of handling similarity queries in peer-to-peer databases. Given a query for a data object, we propose an indexing and searching mechanism which returns the...
175
click to vote
WWW
2010
ACM
15 years 12 months ago
2010
ACM
Key-value stores (KVSs) are the most prevalent storage systems for large scale web services. As they do not have the structural complexities of RDBMSs, they are more efficient. In...
198
click to vote
SAGA
2001
Springer
15 years 11 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
168
click to vote
LREC
2008
15 years 8 months ago
2008
OntoSelect is a dynamic web-based ontology library that harvests, analyzes and organizes ontologies published on the Semantic Web. OntoSelect allows searching as well as browsing ...
135
click to vote
AAAI
1998
15 years 8 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...