801 search results - page 64 / 161 » Minimal Locked Trees |
166
click to vote
HIPC
2007
Springer
16 years 16 days ago
2007
Springer
This paper presents our work in combining peer-to-peer dynamic tree management with hierarchical Operational Transformation (OT) over document trees to achieve low computational an...
191
click to vote
DAC
1994
ACM
15 years 10 months ago
1994
ACM
We provide a new theoretical framework for constructing Steiner routing trees with minimum Elmore delay. Earlier work [3, 13] has established Elmore delay as a high delity estima...
146
click to vote
ECML
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. In some learning settings, the cost of acquiring features for classification must be paid up front, before the classifier is evaluated. In this paper, we introduce the fo...
150
click to vote
NIPS
2007
15 years 7 months ago
2007
Machine learning techniques are increasingly being used to produce a wide-range of classifiers for complex real-world applications that involve nonuniform testing costs and miscl...
209
click to vote
IKE
2003
15 years 7 months ago
2003
Inverted files are widely used to index documents in large-scale information retrieval systems. An inverted file consists of posting lists, which can be stored in either a documen...