Sciweavers

4541 search results - page 713 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
187
Voted
SIGGRAPH
1996
ACM
15 years 11 months ago
Rendering Parametric Surfaces in Pen and Ink
This paper presents new algorithms and techniques for rendering parametric free-form surfaces in pen and ink. In particular, we introduce the idea of "controlled-density hatc...
Georges Winkenbach, David Salesin
CSR
2006
Springer
15 years 10 months ago
All Semi-local Longest Common Subsequences in Subquadratic Time
For two strings a, b of lengths m, n respectively, the longest common subsequence (LCS) problem consists in comparing a and b by computing the length of their LCS. In this paper, w...
Alexandre Tiskin
IICAI
2007
15 years 8 months ago
Extractive Summarization in Clinical Trials Protocol Summaries: A Case Study
This paper presents a method for extracting purpose statements from clinical trial protocol summaries. Simple summarization technology based on regular expressions and natural lang...
Graciela Rosemblat, Laurel Graham, Tony Tse
NIPS
2007
15 years 8 months ago
Sparse Feature Learning for Deep Belief Networks
Unsupervised learning algorithms aim to discover the structure hidden in the data, and to learn representations that are more suitable as input to a supervised machine than the ra...
Marc'Aurelio Ranzato, Y-Lan Boureau, Yann LeCun
RIAO
2007
15 years 8 months ago
Comprehensible and Accurate Cluster Labels in Text Clustering
The purpose of text clustering in information retrieval is to discover groups of semantically related documents. Accurate and comprehensible cluster descriptions (labels) let the ...
Jerzy Stefanowski, Dawid Weiss