Sciweavers

5962 search results - page 114 / 1193
» Efficient Clustering for Orders
Sort
View
ICDE
2004
IEEE
155views Database» more  ICDE 2004»
16 years 7 months ago
A Prime Number Labeling Scheme for Dynamic Ordered XML Trees
Efficient evaluation of XML queries requires the determination of whether a relationship exists between two elements. A number of labeling schemes have been designed to label the ...
Xiaodong Wu, Mong-Li Lee, Wynne Hsu
IADIS
2003
15 years 7 months ago
Effects of Ordered Access Lists in Firewalls
Firewalls are hardware and software systems that protect a network from attacks coming from the Internet. Packet filtering firewalls are efficient, fast and provide a good level o...
Faheem Bukhatwa, Ahmed Patel
CORR
2008
Springer
138views Education» more  CORR 2008»
15 years 6 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...
CORR
2002
Springer
83views Education» more  CORR 2002»
15 years 6 months ago
Optimal Ordered Problem Solver
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...
Jürgen Schmidhuber
SDM
2007
SIAM
112views Data Mining» more  SDM 2007»
15 years 7 months ago
PoClustering: Lossless Clustering of Dissimilarity Data
Given a set of objects V with a dissimilarity measure between pairs of objects in V , a PoCluster is a collection of sets P ⊂ powerset(V ) partially ordered by the ⊂ relation ...
Jinze Liu, Qi Zhang, Wei Wang 0010, Leonard McMill...