Sciweavers

729 search results - page 47 / 146
» And Or Hierarchies and Round Abstraction
Sort
View
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
13 years 6 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
Christoph Lenzen, Roger Wattenhofer
WDAG
2010
Springer
164views Algorithms» more  WDAG 2010»
13 years 5 months ago
It's on Me! The Benefit of Altruism in BAR Environments
Abstract. Cooperation, a necessity for any peer-to-peer (P2P) cooperative service, is often achieved by rewarding good behavior now with the promise of future benefits. However, in...
Edmund L. Wong, Joshua B. Leners, Lorenzo Alvisi

Book
412views
15 years 6 months ago
Algorithms for Clustering Data
"Cluster analysis is an important technique in the rapidly growing field known as exploratory data analysis and is being applied in a variety of engineering and scientific dis...
A. K. Jain, R. C. Dubes
ISSAC
1998
Springer
117views Mathematics» more  ISSAC 1998»
13 years 12 months ago
Lightweight Formal Methods for Computer Algebra Systems
In this paper we demonstrate the use of formal methods tools to provide a semantics for the type hierarchy of the AXIOM computer algebra system, and a methodology for Aldor progra...
Martin Dunstan, Tom Kelsey, Steve Linton, Ursula M...
GD
1995
Springer
13 years 11 months ago
Incremental Layout in DynaDAG
Abstract. Generating incrementally stable layouts is important for visualizing dynamic graphs in many applications. This paper describes DynaDAG, a new heuristic for incremental la...
Stephen C. North