Sciweavers

427 search results - page 22 / 86
» Computing the Local Consensus of Trees
Sort
View
ICASSP
2010
IEEE
14 years 9 months ago
A general formalism for the analysis of distributed algorithms
The major contribution of this paper is the presentation of a general unifying description of distributed algorithms allowing to map local, node-based, algorithms onto a single gl...
Ondrej Sluciak, Thibault Hilaire, Markus Rupp
76
Voted
ACL
2011
14 years 1 months ago
Neutralizing Linguistically Problematic Annotations in Unsupervised Dependency Parsing Evaluation
Dependency parsing is a central NLP task. In this paper we show that the common evaluation for unsupervised dependency parsing is highly sensitive to problematic annotations. We s...
Roy Schwartz, Omri Abend, Roi Reichart, Ari Rappop...
INFOCOM
1996
IEEE
15 years 1 months ago
ARIES: A Rearrangeable Inexpensive Edge-Based On-Line Steiner Algorithm
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
Fred Bauer, Anujan Varma
KDD
2002
ACM
118views Data Mining» more  KDD 2002»
15 years 10 months ago
SECRET: a scalable linear regression tree algorithm
Recently there has been an increasing interest in developing regression models for large datasets that are both accurate and easy to interpret. Regressors that have these properti...
Alin Dobra, Johannes Gehrke
ENTCS
2008
120views more  ENTCS 2008»
14 years 9 months ago
Reasoning about B+ Trees with Operational Semantics and Separation Logic
The B+ tree is an ordered tree structure with a fringe list. It is the most widely used data structure for data organisation and searching in database systems specifically, and, p...
Alan P. Sexton, Hayo Thielecke