Sciweavers

2735 search results - page 462 / 547
» Generalized Displacement Maps
Sort
View
CCS
2007
ACM
16 years 17 days ago
Predicting vulnerable software components
Where do most vulnerabilities occur in software? Our Vulture tool automatically mines existing vulnerability databases and version archives to map past vulnerabilities to componen...
Stephan Neuhaus, Thomas Zimmermann, Christian Holl...
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
16 years 16 days 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
GI
2007
Springer
16 years 16 days ago
Potentials and Requirements of Mobile Ubiquitous Computing for Public Transport
: Public transport plays an important role in our society which is characterized by mobility, individuality, comfort and ecological constraints. It is common opinion that public tr...
Holger Mügge, Karl-Heinz Lüke, Matthias ...
LCTRTS
2007
Springer
16 years 15 days ago
Scratchpad allocation for data aggregates in superperfect graphs
Existing methods place data or code in scratchpad memory, i.e., SPM by either relying on heuristics or resorting to integer programming or mapping it to a graph coloring problem. ...
Lian Li 0002, Quan Hoang Nguyen, Jingling Xue
COMPGEOM
2006
ACM
16 years 10 days ago
An optimal-time algorithm for shortest paths on a convex polytope in three dimensions
We present an optimal-time algorithm for computing (an implicit representation of) the shortest-path map from a fixed source s on the surface of a convex polytope P in three dime...
Yevgeny Schreiber, Micha Sharir