Sciweavers

12536 search results - page 17 / 2508
» Cardinality Networks and Their Applications
Sort
View
141
Voted
BALT
2010
14 years 10 months ago
Bringing Domain Knowledge to Pattern Matching
Abstract. This paper addresses the pattern matching problem for model transformation languages. Despite being an NP-complete problem, the pattern matching can be solved efficiently...
Agris Sostaks
ICML
2001
IEEE
16 years 4 months ago
Feature selection for high-dimensional genomic microarray data
We report on the successful application of feature selection methods to a classification problem in molecular biology involving only 72 data points in a 7130 dimensional space. Ou...
Eric P. Xing, Michael I. Jordan, Richard M. Karp
IMA
2009
Springer
124views Cryptology» more  IMA 2009»
15 years 10 months ago
Comparing with RSA
A multi-set (ms) is a set where an element can occur more than once. ms hash functions (mshfs) map mss of arbitrary cardinality to fixed-length strings. This paper introduces a ne...
Julien Cathalo, David Naccache, Jean-Jacques Quisq...
157
Voted
ICCI
1991
15 years 7 months ago
On the k-Coloring of Intervals
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
Martin C. Carlisle, Errol L. Lloyd
142
Voted
NIPS
2004
15 years 4 months ago
Algebraic Set Kernels with Application to Inference Over Local Image Representations
This paper presents a general family of algebraic positive definite similarity functions over spaces of matrices with varying column rank. The columns can represent local regions ...
Amnon Shashua, Tamir Hazan