Sciweavers

4377 search results - page 552 / 876
» Mass problems and randomness
Sort
View
TCOM
2008
120views more  TCOM 2008»
15 years 6 months ago
Network Coding for Efficient Multicast Routing in Wireless Ad-hoc Networks
Network coding is a powerful coding technique that has been proved to be very effective in achieving the maximum multicast capacity. It is especially suited for new emerging networ...
Jingyao Zhang, Pingyi Fan, Khaled Ben Letaief
JCC
2007
70views more  JCC 2007»
15 years 6 months ago
Self-organizing superimposition algorithm for conformational sampling
Abstract: A novel self-organizing algorithm for conformational sampling is introduced, in which precomputed conformations of rigid fragments are used as templates to enforce the de...
Fangqiang Zhu, Dimitris K. Agrafiotis
CG
2005
Springer
15 years 6 months ago
A polar-plane-based method for natural illumination of plants and trees
We introduce an illumination method for outdoor scenes containing plants and trees. Our method supports multiresolution plant and tree models based on random L-systems. The method...
Maria J. Vicent, Vicente Rosell, Roberto Viv&oacut...
CORR
2000
Springer
134views Education» more  CORR 2000»
15 years 6 months ago
Learning Complexity Dimensions for a Continuous-Time Control System
This paper takes a computational learning theory approach to a problem of linear systems identification. It is assumed that inputs are generated randomly from a known class consist...
Pirkko Kuusela, Daniel Ocone, Eduardo D. Sontag
ECCC
2000
113views more  ECCC 2000»
15 years 6 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich