Sciweavers

1431 search results - page 26 / 287
» The complexity of random ordered structures
Sort
View
CORR
2004
Springer
176views Education» more  CORR 2004»
14 years 9 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
88
Voted
NIPS
2003
14 years 11 months ago
From Algorithmic to Subjective Randomness
We explore the phenomena of subjective randomness as a case study in understanding how people discover structure embedded in noise. We present a rational account of randomness per...
Thomas L. Griffiths, Joshua B. Tenenbaum
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
14 years 7 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
60
Voted
ISCAS
2007
IEEE
138views Hardware» more  ISCAS 2007»
15 years 3 months ago
Adaptive Pinning Synchronization of A General Complex Dynamical Network
— This paper further investigates and answers two fundamental questions in the complex dynamical networks: i) how many nodes should a general complex dynamical network with fixe...
Jin Zhou, Junan Lu, Jinhu Lu
72
Voted
ICCS
2004
Springer
15 years 3 months ago
A Real-Time Total Order Multicast Protocol
Abstract. We describe, analyze and submit results of a real-time total order multicast protocol developed on a distributed real-time system architecture that consists of hierarchic...
Kayhan Erciyes, Ahmet Sahan