11211 search results - page 187 / 2243 » Rank-Sensitive Data Structures |
120
click to vote
SIGPLAN
2002
15 years 2 months ago
2002
We propose a new extension to the purely functional programming language Haskell that supports compile-time meta-programming. The purpose of the system is to support the algorithm...
128
click to vote
WISE
2005
Springer
15 years 8 months ago
2005
Springer
This paper studies automatic extraction of structured data from Web pages. Each of such pages may contain several groups of structured data records. Existing automatic methods stil...
116
Voted
JMLR
2010
14 years 9 months ago
2010
Some online algorithms for linear classification model the uncertainty in their weights over the course of learning. Modeling the full covariance structure of the weights can prov...
174
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
216
click to vote
ICDE
1998
IEEE
16 years 4 months ago
1998
IEEE
We study the problem of maintaining materialized views of graph structured data. The base data consists of records containing identi ers of other records. The data could represent...