Sciweavers

310 search results - page 46 / 62
» Why Delannoy numbers
Sort
View
STOC
2006
ACM
121views Algorithms» more  STOC 2006»
15 years 11 months ago
On adequate performance measures for paging
Memory management is a fundamental problem in computer architecture and operating systems. We consider a two-level memory system with fast, but small cache and slow, but large mai...
Konstantinos Panagiotou, Alexander Souza
ICCV
2007
IEEE
15 years 9 months ago
Diffusion Maps Segmentation of Magnetic Resonance Q-Ball Imaging
We present a Diffusion Maps clustering method applied to diffusion MRI in order to segment complex white matter fiber bundles. It is well-known that diffusion tensor imaging (DTI)...
Demian Wassermann, Maxime Descoteaux, Rachid Deric...
CHI
2004
ACM
16 years 6 months ago
Interactive Comprehensible Data Mining
This paper discusses a novel data mining system devised and developed at Birmingham, which attempts to provide a more effective data mining system. It ties in with the workshop go...
Andy Pryke, Russell Beale
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
15 years 11 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
WETICE
2003
IEEE
15 years 11 months ago
Attack-Resistance of Computational Trust Models
The World Wide Web encourages widely-distributed, open, decentralised systems that span multiple administrative domains. Recent research has turned to trust management [4] as a fr...
Andrew Twigg, Nathan Dimmock