Sciweavers

16430 search results - page 258 / 3286
» On Computable Tree Functions
Sort
View
COMPGEOM
2006
ACM
15 years 8 months ago
I/O-efficient batched union-find and its applications to terrain analysis
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
Pankaj K. Agarwal, Lars Arge, Ke Yi
AC
2003
Springer
15 years 9 months ago
Generic Haskell: Applications
Generic Haskell is an extension of Haskell that supports the construction of generic programs. These lecture notes discuss three advanced generic programming applications: generic ...
Ralf Hinze, Johan Jeuring
IFL
1997
Springer
136views Formal Methods» more  IFL 1997»
15 years 8 months ago
Fully Persistent Graphs - Which One To Choose?
Functional programs, by nature, operate on functional, or persistent, data structures. Therefore, persistent graphs are a prerequisite to express functional graph algorithms. In th...
Martin Erwig
WWW
2010
ACM
15 years 11 months ago
The paths more taken: matching DOM trees to search logs for accurate webpage clustering
An unsupervised clustering of the webpages on a website is a primary requirement for most wrapper induction and automated data extraction methods. Since page content can vary dras...
Deepayan Chakrabarti, Rupesh R. Mehta
ICTAI
2009
IEEE
15 years 11 months ago
Preventing Unwanted Social Inferences with Classification Tree Analysis
A serious threat to user privacy in new mobile and web2.0 applications stems from ‘social inferences’. These unwanted inferences are related to the users’ identity, current ...
Sara Motahari, Sotirios G. Ziavras, Quentin Jones