Sciweavers

11808 search results - page 2090 / 2362
» Isometries and Computability Structures
Sort
View
PREMI
2011
Springer
14 years 9 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
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 9 months ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
SIAMREV
2011
40views more  SIAMREV 2011»
14 years 9 months ago
A Mathematical Model for the Control and Eradication of a Wood Boring Beetle Infestation
We propose a mathematical model for an infestation of a wooded area by a beetle species in which the larvae develop deep in the wood of living trees. Due to the difficulties of det...
Stephen A. Gourley, Xingfu Zou
SIGMOD
2011
ACM
230views Database» more  SIGMOD 2011»
14 years 9 months ago
GBLENDER: visual subgraph query formulation meets query processing
Due to the complexity of graph query languages, the need for visual query interfaces that can reduce the burden of query formulation is fundamental to the spreading of graph data ...
Changjiu Jin, Sourav S. Bhowmick, Xiaokui Xiao, By...
AAAI
2011
14 years 6 months ago
Stopping Rules for Randomized Greedy Triangulation Schemes
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
Andrew Gelfand, Kalev Kask, Rina Dechter
« Prev « First page 2090 / 2362 Last » Next »