Sciweavers

11231 search results - page 256 / 2247
» Digging for Data Structures
Sort
View
SODA
2010
ACM
144views Algorithms» more  SODA 2010»
15 years 5 months ago
Cell-Probe Lower Bounds for Succinct Partial Sums
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
Mihai Patrascu, Emanuele Viola
DATE
1997
IEEE
99views Hardware» more  DATE 1997»
15 years 10 months ago
Fast controllers for data dominated applications
A target structure for implementing fast edge-triggered control units is presented. In many cases, the proposed controller is faster than a one-hot encoded structure as its correc...
Andre Hertwig, Hans-Joachim Wunderlich
FSKD
2006
Springer
127views Fuzzy Logic» more  FSKD 2006»
15 years 10 months ago
On the Society of Genome: Social Affiliation Network Analysis of Microarray Data
Abstract. To investigate the structure of the genomic interaction network built from yeast gene-expression compendium dataset of hundreds of systematic perturbations, social affili...
Jung Hun Ohn, Jihoon Kim, Ju Han Kim
ICPR
2010
IEEE
15 years 4 months ago
Audio-Visual Classification and Fusion of Spontaneous Affective Data in Likelihood Space
This paper focuses on audio-visual (using facial expression, shoulder and audio cues) classification of spontaneous affect, utilising generative models for classification (i) in t...
Mihalis A. Nicolaou, Hatice Gunes, Maja Pantic
SODA
2012
ACM
191views Algorithms» more  SODA 2012»
13 years 9 months ago
Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a contiguous submatrix of the given matrix, and it...
Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sha...