Sciweavers

534 search results - page 64 / 107
» Tight approximation algorithm for connectivity augmentation ...
Sort
View
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
14 years 1 months ago
Generating large-scale neural networks through discovering geometric regularities
Connectivity patterns in biological brains exhibit many repeating motifs. This repetition mirrors inherent geometric regularities in the physical world. For example, stimuli that ...
Jason Gauci, Kenneth O. Stanley

Book
246views
15 years 5 months ago
Using, Understanding, and Unraveling The OCaml Language
"These course notes are addressed to a wide audience of people interested in modern programming languages in general, ML-like languages in particular, or simply in OCaml, whet...
Didier Remy
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
14 years 1 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
COCOON
2005
Springer
14 years 1 months ago
Fault-Tolerant Relay Node Placement in Wireless Sensor Networks
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in an Euclidean plane, our objective is to place minimum nu...
Hai Liu, Peng-Jun Wan, Xiaohua Jia
FCCM
1997
IEEE
111views VLSI» more  FCCM 1997»
13 years 12 months ago
Real-time stereo vision on the PARTS reconfigurable computer
This paper describes a powerful, scalable, reconfigurable computer called the PARTS engine. The PARTS engine consists of 16 Xilinx 4025 FPGAs, and 16 one-megabyte SRAMs. The FPGAs...
John Woodfill, Brian Von Herzen