Sciweavers

775 search results - page 19 / 155
» Algorithm Selection via Ranking
Sort
View
PREMI
2011
Springer
12 years 11 months ago
Finding Potential Seeds through Rank Aggregation of Web Searches
This paper presents a potential seed selection algorithm for web crawlers using a gain - share scoring approach. Initially we consider a set of arbitrarily chosen tourism queries. ...
Rajendra Prasath, Pinar Öztürk
CRISIS
2009
13 years 10 months ago
Modeling dependencies in security risk management
This paper develops a framework for analyzing security risk dependencies in organizations and ranking the risks. The framework captures how risk `diffuses' via complex interac...
Tansu Alpcan, Nicholas Bambos
TSP
2011
152views more  TSP 2011»
13 years 3 months ago
Blind Adaptive Constrained Constant-Modulus Reduced-Rank Interference Suppression Algorithms Based on Interpolation and Switched
—This work proposes a blind adaptive reduced-rank scheme and constrained constant-modulus (CCM) adaptive algorithms for interference suppression in wireless communications system...
Rodrigo C. de Lamare, Raimundo Sampaio Neto, Marti...
RTA
2004
Springer
14 years 2 months ago
Querying Unranked Trees with Stepwise Tree Automata
The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata c...
Julien Carme, Joachim Niehren, Marc Tommasi
COMPGEOM
2011
ACM
13 years 16 days ago
An output-sensitive algorithm for persistent homology
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
Chao Chen, Michael Kerber