Sciweavers

1024 search results - page 143 / 205
» The Generalized PatchMatch Correspondence Algorithm
Sort
View
KDD
2005
ACM
160views Data Mining» more  KDD 2005»
14 years 9 months ago
Optimizing time series discretization for knowledge discovery
Knowledge Discovery in time series usually requires symbolic time series. Many discretization methods that convert numeric time series to symbolic time series ignore the temporal ...
Alfred Ultsch, Fabian Mörchen
IPPS
2009
IEEE
14 years 3 months ago
Minimizing total busy time in parallel scheduling with application to optical networks
—We consider a scheduling problem in which a bounded number of jobs can be processed simultaneously by a single machine. The input is a set of n jobs J = {J1, . . . , Jn}. Each j...
Michele Flammini, Gianpiero Monaco, Luca Moscardel...
HT
2009
ACM
14 years 3 months ago
Contextualising tags in collaborative tagging systems
Collaborative tagging systems are now popular tools for organising and sharing information on the Web. While collaborative tagging offers many advantages over the use of controll...
Ching-man Au Yeung, Nicholas Gibbins, Nigel Shadbo...
CIKM
2007
Springer
14 years 2 months ago
Optimizing parallel itineraries for knn query processing in wireless sensor networks
Spatial queries for extracting data from wireless sensor networks are important for many applications, such as environmental monitoring and military surveillance. One such query i...
Tao-Young Fu, Wen-Chih Peng, Wang-Chien Lee
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
14 years 2 months ago
A novel generative encoding for exploiting neural network sensor and output geometry
A significant problem for evolving artificial neural networks is that the physical arrangement of sensors and effectors is invisible to the evolutionary algorithm. For example,...
David B. D'Ambrosio, Kenneth O. Stanley