Sciweavers

10988 search results - page 1791 / 2198
» Algorithmic Folding Complexity
Sort
View
WSDM
2010
ACM
215views Data Mining» more  WSDM 2010»
16 years 2 months ago
Boilerplate Detection using Shallow Text Features
In addition to the actual content Web pages consist of navigational elements, templates, and advertisements. This boilerplate text typically is not related to the main content, ma...
Christian Kohlschütter, Peter Fankhauser, Wol...
I3D
2010
ACM
16 years 2 months ago
Efficient Sparse Voxel Octrees
In this paper we examine the possibilities of using voxel representations as a generic way for expressing complex and feature-rich geometry on current and future GPUs. We present ...
Samuli Laine, Tero Karras
SDM
2009
SIAM
193views Data Mining» more  SDM 2009»
16 years 2 months ago
Agglomerative Mean-Shift Clustering via Query Set Compression.
Mean-Shift (MS) is a powerful non-parametric clustering method. Although good accuracy can be achieved, its computational cost is particularly expensive even on moderate data sets...
Xiaotong Yuan, Bao-Gang Hu, Ran He
ICDCS
2009
IEEE
16 years 2 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
ALT
2001
Springer
16 years 1 months ago
Learning Recursive Functions Refutably
Abstract. Learning of recursive functions refutably means that for every recursive function, the learning machine has either to learn this function or to refute it, i.e., to signal...
Sanjay Jain, Efim B. Kinber, Rolf Wiehagen, Thomas...
« Prev « First page 1791 / 2198 Last » Next »