Sciweavers

2104 search results - page 34 / 421
» Sorting with networks of data structures
Sort
View
SOFSEM
2005
Springer
15 years 9 months ago
RAQ: A Range-Queriable Distributed Data Structure
Different structures are used in peer-to-peer networks to represent their inherently distributed, self-organized and decentralized memory structure. In this paper, a simple range...
Hamid Nazerzadeh, Mohammad Ghodsi
SEBD
2003
159views Database» more  SEBD 2003»
15 years 5 months ago
Spatial Tree Logics to reason about Semistructured Data
The Ambient Logic is a modal logic proposed to describe the structural and computational properties of distributed and mobile computations. The static part of the Ambient Logic is,...
Giovanni Conforti, Giorgio Ghelli
SAC
2005
ACM
15 years 9 months ago
Rearranging data objects for efficient and stable clustering
When a partitional structure is derived from a data set using a data mining algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of...
Gyesung Lee, Xindong Wu, Jinho Chon
118
Voted
JCP
2008
103views more  JCP 2008»
15 years 3 months ago
Weighted Clustering and Evolutionary Analysis of Hybrid Attributes Data Streams
It presents some definitions of projected cluster and projected cluster group on hybrid attributes after having given some definitions on ordered attributes and sorted attributes t...
Xinquan Chen
SLIP
2009
ACM
15 years 10 months ago
From 3D circuit technologies and data structures to interconnect prediction
New technologies such as 3D integration are becoming a new force that is keeping Moore’s law in effect in today’s nano era. By adding a third dimension in current 2D circuits...
Robert Fischbach, Jens Lienig, Tilo Meister