Sciweavers

271 search results - page 8 / 55
» A Comparative Study Of Algorithms For Land Cover Change
Sort
View
INFOCOM
2010
IEEE
13 years 6 months ago
Resilient Routing for Sensor Networks Using Hyperbolic Embedding of Universal Covering Space
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
Wei Zeng, Rik Sarkar, Feng Luo 0002, Xianfeng Gu, ...
CVPR
2012
IEEE
11 years 10 months ago
Changedetection.net: A new change detection benchmark dataset
Change detection is one of the most commonly encountered low-level tasks in computer vision and video processing. A plethora of algorithms have been developed to date, yet no wide...
Nil Goyette, Pierre-Marc Jodoin, Fatih Porikli, Ja...
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 7 months ago
Quantization of Discrete Probability Distributions
We study the problem of quantization of discrete probability distributions, arising in universal coding, as well as other applications. We show, that in many situations this probl...
Yuriy A. Reznik
GECCO
2003
Springer
113views Optimization» more  GECCO 2003»
14 years 26 days ago
The Effect of Binary Matching Rules in Negative Selection
Negative selection algorithm is one of the most widely used techniques in the field of artificial immune systems. It is primarily used to detect changes in data/behavior patterns...
Fabio A. González, Dipankar Dasgupta, Jonat...
MST
2007
154views more  MST 2007»
13 years 7 months ago
Crown Structures for Vertex Cover Kernelization
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem. Two vertex cover kernelization methods are discus...
Faisal N. Abu-Khzam, Michael R. Fellows, Michael A...