411 search results - page 41 / 83 » Efficient View Maintenance Using Version Numbers |
DBPL
1995
Springer
15 years 1 months ago
1995
Springer
We study the problem of maintaining recursively-de ned views, such as the transitive closure of a relation, in traditional relational languages that do not have recursion mechanis...
116
click to vote
IDEAL
2007
Springer
15 years 3 months ago
2007
Springer
In the information age, online collaboration and social networks are of increasing importance and quickly becoming an integral part of our lifestyle. In business, social networking...
SIAMCOMP
2008
14 years 9 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Clustering data in high dimensions is believed to be a hard problem in general. A number of efficient clustering algorithms developed in recent years address this problem by proje...
NIPS
2008
14 years 11 months ago
2008
We provide a new analysis of an efficient margin-based algorithm for selective sampling in classification problems. Using the so-called Tsybakov low noise condition to parametrize...