Sciweavers

1746 search results - page 59 / 350
» Recent Developments in Algorithmic Teaching
Sort
View
ICIP
2007
IEEE
14 years 11 months ago
Statistically Driven Sparse Image Approximation
Finding the sparsest approximation of an image as a sum of basis functions drawn from a redundant dictionary is an NPhard problem. In the case of a dictionary whose elements form ...
Rosa M. Figueras i Ventura, Eero P. Simoncelli
DFG
2009
Springer
14 years 3 months ago
Iterative Compression for Exactly Solving NP-Hard Minimization Problems
Abstract. We survey the conceptual framework and several applications of the iterative compression technique introduced in 2004 by Reed, Smith, and Vetta. This technique has proven...
Jiong Guo, Hannes Moser, Rolf Niedermeier
JDA
2007
97views more  JDA 2007»
13 years 9 months ago
Local solutions for global problems in wireless networks
In this paper, we review a recently developed class of algorithms that solve global problems in unit distance wireless networks by means of local algorithms. A local algorithm is ...
Jorge Urrutia
IJCNN
2007
IEEE
14 years 3 months ago
Robotic Architecture Inspired on Behavior Analysis
Learning by human tutelage means that a human being guides the attention of a robot or agent in order to teach it a given concept. This kind of learning is very important to devel...
Claudio A. Policastro, Roseli A. F. Romero, Giovan...
IADIS
2004
13 years 10 months ago
Constructing Scorm Compliant Course Based on High Level Petri Nets
With rapid development of the Internet, e-learning system has become more and more popular. Currently, to solve the issue of sharing and reusing of teaching materials in different...
Jun-Ming Su, Shian-Shyong Tseng, Chia-Yu Chen, Jui...