Sciweavers

6245 search results - page 915 / 1249
» A Case for Aggregate Networks
Sort
View
170
Voted
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
STANDARDVIEW
1998
128views more  STANDARDVIEW 1998»
15 years 6 months ago
Compatibility, standards, and software production
Compatibility is a key strategic decision in software production. Proposals exist for standards in several fields of software production, such as networking (ISO and IEEE), operat...
Giancarlo Succi, Andrea Valerio, Tullio Vernazza, ...
PSYCHNOLOGY
2008
94views more  PSYCHNOLOGY 2008»
15 years 6 months ago
A Design Framework for Mapping Social Relationships
This paper describes a design framework for representing social-spatial data on maps and diagrams and then illustrates the design approaches for representing social data in two ap...
Alistair G. Sutcliffe
ISAMI
2010
15 years 4 months ago
Why Traders Need Ambient Intelligence
Trading is widely recognized as a stressful profession. Taking decisions under stress negatively affects both, the finances and the health of the trader. Providing support to incre...
Javier Martínez Fernández, Juan Carl...
SIAMCOMP
2010
172views more  SIAMCOMP 2010»
15 years 1 months ago
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Gábor Ivanyos, Marek Karpinski, Nitin Saxen...