Sciweavers

3172 search results - page 562 / 635
» On the Random-Self-Reducibility of Complete Sets
Sort
View
CCCG
2009
15 years 7 months ago
On the Dilation of Delaunay Triangulations of Points in Convex Position
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
Shiliang Cui, Iyad A. Kanj, Ge Xia
CIKM
2008
Springer
15 years 7 months ago
Cost-effective spam detection in p2p file-sharing systems
Spam is highly pervasive in P2P file-sharing systems and is difficult to detect automatically before actually downloading a file due to the insufficient and biased description of ...
Dongmei Jia
CLEF
2010
Springer
15 years 7 months ago
Blind Relevance Feedback for the ImageCLEF Wikipedia Retrieval Task
In this paper we will describe Berkeley's approach to the ImageCLEF Wikipedia Retrieval task for 2010. Our approach to this task was primarily to use text-based searches on th...
Ray R. Larson
ERCIMDL
2010
Springer
162views Education» more  ERCIMDL 2010»
15 years 7 months ago
Citation Graph Based Ranking in Invenio
Invenio is the web-based integrated digital library system developed at CERN. Within this framework, we present four types of ranking models based on the citation graph that comple...
Ludmila Marian, Jean-Yves LeMeur, Martin Rajman, M...
GECCO
2008
Springer
130views Optimization» more  GECCO 2008»
15 years 7 months ago
Parsimony pressure made easy
The parsimony pressure method is perhaps the simplest and most frequently used method to control bloat in genetic programming. In this paper we first reconsider the size evolutio...
Riccardo Poli, Nicholas Freitag McPhee