Sciweavers

6120 search results - page 1174 / 1224
» The Power of Linear Functions
Sort
View
SIGMOD
2009
ACM
155views Database» more  SIGMOD 2009»
14 years 8 months ago
Efficient top-k algorithms for fuzzy search in string collections
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
Rares Vernica, Chen Li
SIGMOD
2008
ACM
107views Database» more  SIGMOD 2008»
14 years 7 months ago
Outlier-robust clustering using independent components
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
Christian Böhm, Christos Faloutsos, Claudia P...
SIGMOD
2008
ACM
179views Database» more  SIGMOD 2008»
14 years 7 months ago
BibNetMiner: mining bibliographic information networks
Online bibliographic databases, such as DBLP in computer science and PubMed in medical sciences, contain abundant information about research publications in different fields. Each...
Yizhou Sun, Tianyi Wu, Zhijun Yin, Hong Cheng, Jia...
ICFP
2008
ACM
14 years 7 months ago
Quotient lenses
There are now a number of bidirectional programming languages, where every program can be read both as a forward transformation mapping one data structure to another and as a reve...
J. Nathan Foster, Alexandre Pilkiewicz, Benjamin C...
ICFP
2006
ACM
14 years 7 months ago
Extensible programming with first-class cases
We present language mechanisms for polymorphic, extensible records and their exact dual, polymorphic sums with extensible first-class cases. These features make it possible to eas...
Matthias Blume, Umut A. Acar, Wonseok Chae
« Prev « First page 1174 / 1224 Last » Next »