Sciweavers

3096 search results - page 289 / 620
» The Generalized FITC Approximation
Sort
View
ICCV
2005
IEEE
16 years 7 days ago
A Unifying Approach to Hard and Probabilistic Clustering
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...
Ron Zass, Amnon Shashua
ICDCSW
2005
IEEE
16 years 7 days ago
Increasing Attack Resiliency of Wireless Ad Hoc and Sensor Networks
An ad hoc or sensor network that is employed for security sensitive applications is expected to tolerate a certain quantity of maliciously behaving nodes. Algorithms must be desig...
Harald Vogt
CAIP
2005
Springer
107views Image Analysis» more  CAIP 2005»
16 years 5 days ago
Minimum-Length Polygons of First-Class Simple Cube-Curves
We consider simple cube-curves in the orthogonal 3D grid. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded set. The c...
Fajie Li, Reinhard Klette
ESA
2005
Springer
140views Algorithms» more  ESA 2005»
16 years 4 days ago
Bucket Game with Applications to Set Multicover and Dynamic Page Migration
We present a simple two-person Bucket Game, based on throwing balls into buckets, and we discuss possible players’ strategies. We use these strategies to create an approximation ...
Marcin Bienkowski, Jaroslaw Byrka
ICANN
2005
Springer
16 years 4 days ago
Informational Energy Kernel for LVQ
We describe a kernel method which uses the maximization of Onicescu’s informational energy as a criteria for computing the relevances of input features. This adaptive relevance d...
Angel Cataron, Razvan Andonie