Sciweavers

2373 search results - page 276 / 475
» Complexities for generalized models of self-assembly
Sort
View
DOCENG
2010
ACM
15 years 7 months ago
Linking data and presentations: from mapping to active transformations
Modern GUI toolkits, and especially RIA ones, propose the concept of binding to dynamically link domain data and their presentations. Bindings are very simple to use for predefine...
Olivier Beaudoux, Arnaud Blouin
GLOBECOM
2008
IEEE
15 years 6 months ago
Novel Rateless Coded Selection Cooperation in Dual-Hop Relaying Systems
Selection cooperation is proposed for rateless coded relaying by developing a novel low-complexity protocol that exploits all source-destination, source-relay, and relay-destinatio...
Reza Nikjah, Norman C. Beaulieu
COMPUTER
2002
129views more  COMPUTER 2002»
15 years 6 months ago
Networks on Chips: A New SoC Paradigm
of abstraction and coarse granularity and distributed communication control. Focusing on using probabilistic metrics such as average values or variance to quantify design objective...
Luca Benini, Giovanni De Micheli
ICCV
2003
IEEE
16 years 8 months ago
Minimally-Supervised Classification using Multiple Observation Sets
This paper discusses building complex classifiers from a single labeled example and vast number of unlabeled observation sets, each derived from observation of a single process or...
Chris Stauffer
ICIP
2002
IEEE
16 years 8 months ago
Multiresolution 3D mesh compression
In this paper, we propose an efficient low complexity compression scheme for densely sampled irregular 3D meshes. This scheme is based on 3D multiresolution analysis (3D Discrete ...
Frédéric Payan, Marc Antonini