Sciweavers

1568 search results - page 222 / 314
» The problem of examination questions in algorithmics
Sort
View
CORR
2010
Springer
66views Education» more  CORR 2010»
15 years 4 months ago
Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems
A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior of a typical po...
Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
CACM
2007
164views more  CACM 2007»
15 years 4 months ago
Is abstraction the key to computing?
ACTION THE KEY TO COMPUTING? Why is it that some software engineers and computer scientists are able to produce clear, elegant designs and programs, while others cannot? Is it poss...
Jeff Kramer
CVPR
2009
IEEE
16 years 10 months ago
D - Clutter: Building object model library from unsupervised segmentation of cluttered scenes
Autonomous systems which learn and utilize a limited visual vocabulary have wide spread applications. Enabling such systems to segment a set of cluttered scenes into objects is ...
Chandra Kambhamettu, Dimitris N. Metaxas, Gowri So...
SIAMJO
2010
84views more  SIAMJO 2010»
15 years 2 months ago
A Redistributed Proximal Bundle Method for Nonconvex Optimization
Proximal bundle methods have been shown to be highly successful optimization methods for unconstrained convex problems with discontinuous first derivatives. This naturally leads ...
Warren Hare, Claudia A. Sagastizábal
ENTCS
2010
96views more  ENTCS 2010»
15 years 1 months ago
Programming in Biomolecular Computation
Our goal is to provide a top-down approach to biomolecular computation. In spite of widespread discussion about connections between biology and computation, one question seems not...
Lars Hartmann, Neil D. Jones, Jakob Grue Simonsen