Sciweavers

241 search results - page 48 / 49
» Implicit Parallelism
Sort
View
ISNN
2005
Springer
14 years 28 days ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
MIDDLEWARE
2004
Springer
14 years 24 days ago
The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations
In recent years, the gossip-based communication model in large-scale distributed systems has become a general paradigm with important applications which include information dissemi...
Márk Jelasity, Rachid Guerraoui, Anne-Marie...
MIDDLEWARE
2004
Springer
14 years 24 days ago
Developing and Managing Software Components in an Ontology-Based Application Server
Application servers provide many functionalities commonly needed in the development of a complex distributed application. So far, the functionalities have mostly been developed an...
Daniel Oberle, Andreas Eberhart, Steffen Staab, Ra...
HICSS
1994
IEEE
141views Biometrics» more  HICSS 1994»
13 years 11 months ago
Empirical CATeam Research in Meetings
Meeting research and especially research on Computer Supported Meetings of natural teams is not available in abundance. What is reported of meetings often uses a rather limited th...
Helmut Krcmar, Henrik Lewe, Gerhard Schwabe
DAC
2008
ACM
13 years 9 months ago
DeMOR: decentralized model order reduction of linear networks with massive ports
Model order reduction is an efficient technique to reduce the system complexity while producing a good approximation of the input-output behavior. However, the efficiency of reduc...
Boyuan Yan, Lingfei Zhou, Sheldon X.-D. Tan, Jie C...