Sciweavers

6598 search results - page 1232 / 1320
» Graph Theory with Applications
Sort
View
APPROX
2006
Springer
109views Algorithms» more  APPROX 2006»
15 years 8 months ago
Dobrushin Conditions and Systematic Scan
We consider Glauber dynamics on finite spin systems. The mixing time of Glauber dynamics can be bounded in terms of the influences of sites on each other. We consider three parame...
Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum
ECOOP
2006
Springer
15 years 8 months ago
Demeter Interfaces: Adaptive Programming Without Surprises
Adaptive Programming (AP) allows for the separate definition of data structures and traversals with attached computations, performed during the traversal, that operate on these dat...
Therapon Skotiniotis, Jeffrey Palm, Karl J. Lieber...
KDD
2000
ACM
222views Data Mining» more  KDD 2000»
15 years 8 months ago
Interactive exploration of very large relational datasets through 3D dynamic projections
The grand tour, one of the most popular methods for multidimensional data exploration, is based on orthogonally projecting multidimensional data to a sequence of lower dimensional...
Li Yang
POS
1987
Springer
15 years 8 months ago
Realisation of a Dynamically Grouped Object-Oriented Virtual Memory Hierarchy
Conventional paging systems do not perform well with large object-oriented environments (such as Smalltalk-801 [GR83]) due to the fine granularity of objects and the persistence o...
Ifor Williams, Mario Wolczko, T. P. Hopkins
COCO
2010
Springer
186views Algorithms» more  COCO 2010»
15 years 7 months ago
Derandomized Parallel Repetition of Structured PCPs
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...
Irit Dinur, Or Meir
« Prev « First page 1232 / 1320 Last » Next »