Sciweavers

4541 search results - page 475 / 909
» Cache-Oblivious Algorithms and Data Structures
Sort
View
IR
2008
15 years 5 months ago
A compressed self-index using a Ziv-Lempel dictionary
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
Luís M. S. Russo, Arlindo L. Oliveira
FCCM
2011
IEEE
311views VLSI» more  FCCM 2011»
14 years 8 months ago
String Matching in Hardware Using the FM-Index
—String matching is a ubiquitous problem that arises in a wide range of applications in computing, e.g., packet routing, intrusion detection, web querying, and genome analysis. D...
Edward Fernandez, Walid Najjar, Stefano Lonardi
SMI
2005
IEEE
15 years 10 months ago
Mesh Editing with an Embedded Network of Curves
We propose a new topological data structure for representing a set of polygonal curves embedded in a meshed surface. In this embedding, the vertices of the curve do not necessaril...
Wan-Chiu Li, Bruno Lévy, Jean-Claude Paul
ICAD
2004
15 years 6 months ago
Emotionface: Prototype Facial Expression Display of Emotion in Music
EmotionFace is a software interface for visually displaying the self-reported emotion expressed by music. Taken in reverse, it can be viewed as a facial expression whose auditory ...
Emery Schubert
SIAMJO
2008
85views more  SIAMJO 2008»
15 years 5 months ago
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
We consider a rather general class of mathematical programming problems with data uncertainty, where the uncertainty set is represented by a system of convex inequalities. We prove...
Igor Averbakh, Yun-Bin Zhao