494 search results - page 49 / 99 » Heap Building Bounds |
61
Voted
OSDI
2004
ACM
15 years 11 months ago
2004
ACM
FUSE is a lightweight failure notification service for building distributed systems. Distributed systems built with FUSE are guaranteed that failure notifications never fail. When...
PKDD
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Or...
PAKDD
2004
ACM
15 years 4 months ago
2004
ACM
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
70
Voted
LREC
2010
15 years 14 days ago
2010
The Semantic Web is facing the important challenge to maintain its promise of a real world-wide graph of interconnected resources. Unfortunately, while URIs almost guarantee a dir...
117
click to vote
OPODIS
2004
15 years 12 days ago
2004
A localized Delaunay triangulation owns the following interesting properties in a wireless ad hoc setting: it can be built with localized information, the communication cost impos...