Sciweavers

798 search results - page 23 / 160
» Interval Methods: An Introduction
Sort
View
ICIP
2002
IEEE
14 years 11 months ago
Image resampling between orthogonal and hexagonal lattices
Resampling techniques are commonly required in digital image processing systems. Many times the classical interpolation functions are used, i.e., nearest-neighbour interpolation a...
Dimitri Van De Ville, Rik Van de Walle, Wilfried P...
ICANNGA
2007
Springer
110views Algorithms» more  ICANNGA 2007»
14 years 4 months ago
Genetic Programming for Proactive Aggregation Protocols
Abstract. We present an approach for automated generation of proactive aggregation protocols using Genetic Programming. First a short introduction into aggregation and proactive pr...
Thomas Weise, Kurt Geihs, Philipp A. Baer
DEXA
2008
Springer
155views Database» more  DEXA 2008»
13 years 11 months ago
NM-Tree: Flexible Approximate Similarity Search in Metric and Non-metric Spaces
So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric...
Tomás Skopal, Jakub Lokoc
JCS
1998
338views more  JCS 1998»
13 years 9 months ago
Intrusion Detection Using Sequences of System Calls
A method is introducted for detecting intrusions at the level of privileged processes. Evidence is given that short sequences of system calls executed by running processes are a g...
Steven A. Hofmeyr, Stephanie Forrest, Anil Somayaj...
EOR
2006
130views more  EOR 2006»
13 years 10 months ago
A Benders decomposition approach for the robust spanning tree problem with interval data
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...
Roberto Montemanni