Sciweavers

2432 search results - page 401 / 487
» Degrees and choice numbers
Sort
View
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 10 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
WMRD
1990
15 years 10 months ago
Replication in Ficus Distributed File Systems
Ficus is a replicated general ling environment for Unix intended to scale to very large nationwide networks. The system employs an optimistic one copy availability" model in ...
Gerald J. Popek, Richard G. Guy, Thomas W. Page Jr...
SIGIR
2010
ACM
15 years 10 months ago
The importance of anchor text for ad hoc search revisited
It is generally believed that propagated anchor text is very important for effective Web search as offered by the commercial search engines. “Google Bombs” are a notable illus...
Marijn Koolen, Jaap Kamps
CPAIOR
2004
Springer
15 years 10 months ago
Building Models through Formal Specification
Abstract. Over the past years, a number of increasingly expressive languages for modelling constraint and optimisation problems have evolved. In developing a strategy to ease the c...
Gerrit Renker, Hatem Ahriz
HIPC
2000
Springer
15 years 10 months ago
A Weight Based Distributed Clustering Algorithm for Mobile ad hoc Networks
In this paper, we propose a distributed clustering algorithm for a multi-hop packet radio network. These types of networks, also known as ad hoc networks, are dynamic in nature due...
Mainak Chatterjee, Sajal K. Das, Damla Turgut