Sciweavers

NIPS
2003
13 years 11 months ago
Online Passive-Aggressive Algorithms
We present a family of margin based online learning algorithms for various prediction tasks. In particular we derive and analyze algorithms for binary and multiclass categorizatio...
Shai Shalev-Shwartz, Koby Crammer, Ofer Dekel, Yor...
NIPS
2003
13 years 11 months ago
Fast Feature Selection from Microarray Expression Data via Multiplicative Large Margin Algorithms
New feature selection algorithms for linear threshold functions are described which combine backward elimination with an adaptive regularization method. This makes them particular...
Claudio Gentile
WSCG
2004
205views more  WSCG 2004»
13 years 11 months ago
Visualisation System Based on Image Warping and Delaunay Triangulation of the Space
In this article we present a visualisation algorithm based on image warping. A source data for the algorithm is a set of images with colour and depth information rendered for the ...
Przemyslaw Kozankiewicz
WSS
2001
111views Control Systems» more  WSS 2001»
13 years 11 months ago
Cross-Over Composition - Enforcement of Fairness under Unfair Adversary
Abstract. We study a special type of self-stabilizing algorithms composition : the cross-over composition (A B). The cross-over composition is the generalization of the algorithm c...
Joffroy Beauquier, Maria Gradinariu, Colette Johne...
WSCG
2001
110views more  WSCG 2001»
13 years 11 months ago
Algorithms to Test Ray-Triangle Intersection. Comparative Study
In this article we present an algorithm to determine the intersection between rays and triangles based on the idea of the study of signs with respect to triangles. One of the adva...
Rafael Jesús Segura, Francisco R. Feito
WSC
2001
13 years 11 months ago
On improving the performance of simulation-based algorithms for average reward processes with application to network pricing
We address performance issues associated with simulationbased algorithms for optimizing Markov reward processes. Specifically, we are concerned with algorithms that exploit the re...
Enrique Campos-Náñez, Stephen D. Pat...
UAI
2004
13 years 11 months ago
A Complete Anytime Algorithm for Treewidth
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
Vibhav Gogate, Rina Dechter
WAE
2001
227views Algorithms» more  WAE 2001»
13 years 11 months ago
Compact DFA Representation for Fast Regular Expression Search
We present a new technique to encode a deterministic nite automaton (DFA). Based on the speci c properties of Glushkov's nondeterministic nite automaton (NFA) construction alg...
Gonzalo Navarro, Mathieu Raffinot
WAE
2001
236views Algorithms» more  WAE 2001»
13 years 11 months ago
Experiences with the Design and Implementation of Space-Efficient Deques
Abstract. A new realization of a space-efficient deque is presented. The data structure is constructed from three singly resizable arrays, each of which is a blockwiseallocated pil...
Jyrki Katajainen, Bjarke Buur Mortensen
WAE
2001
223views Algorithms» more  WAE 2001»
13 years 11 months ago
An Adaptable and Extensible Geometry Kernel
Geometric algorithms are based on geometric objects such as points, lines and circles. The term Kernel refers to a collection of representations for constant-size geometric objects...
Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvai...