3055 search results - page 380 / 611 » Randomized Search Trees |
128
click to vote
TOMS
2010
15 years 2 months ago
2010
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
123
Voted
FOCS
2009
IEEE
15 years 1 months ago
2009
IEEE
We give a new model of learning motivated by smoothed analysis (Spielman and Teng, 2001). In this model, we analyze two new algorithms, for PAC-learning DNFs and agnostically learn...
113
Voted
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
It is well known that using high-locality representations is important for efficient evolutionary search. This paper discusses how the locality of a representation influences the ...
125
Voted
WWW
2004
ACM
16 years 4 months ago
2004
ACM
Search results generated by searchable databases are served dynamically and far larger than the static documents on the Web. These results pages have been referred to as the Deep ...
134
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
1 The unstructured Peer-to-Peer (P2P) systems usually use a “blind search” method to find the requested data object by propagating a query to a number of peers randomly. In or...