Sciweavers

3497 search results - page 20 / 700
» Making Distributed Applications Robust
Sort
View
INFOCOM
2006
IEEE
15 years 5 months ago
Mistreatment in Distributed Caching Groups: Causes and Implications
— Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the...
Nikolaos Laoutaris, Georgios Smaragdakis, Azer Bes...
CONCUR
2007
Springer
15 years 6 months ago
Making Random Choices Invisible to the Scheduler
Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to res...
Konstantinos Chatzikokolakis, Catuscia Palamidessi
80
Voted
IPPS
2006
IEEE
15 years 5 months ago
Making lockless synchronization fast: performance implications of memory reclamation
Achieving high performance for concurrent applications on modern multiprocessors remains challenging. Many programmers avoid locking to improve performance, while others replace l...
Thomas E. Hart, Paul E. McKenney, Angela Demke Bro...
DAGM
2006
Springer
15 years 3 months ago
Robust Non-rigid Object Tracking Using Point Distribution Manifolds
Abstract. We present an approach to non-rigid object tracking designed to handle textured objects in crowded scenes captured by non-static cameras. For this purpose, groups of low-...
Tom Mathes, Justus H. Piater
ICDM
2005
IEEE
161views Data Mining» more  ICDM 2005»
15 years 5 months ago
Making Logistic Regression a Core Data Mining Tool with TR-IRLS
Binary classification is a core data mining task. For large datasets or real-time applications, desirable classifiers are accurate, fast, and need no parameter tuning. We presen...
Paul Komarek, Andrew W. Moore