5144 search results - page 306 / 1029 » Enhancing Search with Structure |
181
click to vote
JACM
2007
15 years 6 months ago
2007
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structure...
157
click to vote
APN
1999
Springer
15 years 11 months ago
1999
Springer
: This paper examines how object-oriented extensions to the Petri Net formalism provide flexible structuring primitives which can aid the modelling of network protocols. A key bene...
159
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
169
click to vote
CP
2005
Springer
16 years 7 days ago
2005
Springer
Abstract. In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability proble...
185
click to vote
TKDE
2008
15 years 6 months ago
2008
Similarity-based search has been a key factor for many applications such as multimedia retrieval, data mining, Web search and retrieval, and so on. There are two important issues r...