Sciweavers

4516 search results - page 76 / 904
» Data Structures in the Design of Interfaces
Sort
View
CIKM
2009
Springer
15 years 6 months ago
An empirical study on using hidden markov model for search interface segmentation
This paper describes a hidden Markov model (HMM) based approach to perform search interface segmentation. Automatic processing of an interface is a must to access the invisible co...
Ritu Khare, Yuan An
SCOPES
2007
Springer
15 years 7 months ago
Optimization of dynamic data structures in multimedia embedded systems using evolutionary computation
Embedded consumer devices are increasing their capabilities and can now implement new multimedia applications reserved only for powerful desktops a few years ago. These applicatio...
David Atienza, Christos Baloukas, Lazaros Papadopo...
ISAAC
2007
Springer
108views Algorithms» more  ISAAC 2007»
15 years 7 months ago
Checking Value-Sensitive Data Structures in Sublinear Space
Checking value-sensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in c...
Michael T. Goodrich, Jonathan Z. Sun
EMMCVPR
2001
Springer
15 years 5 months ago
Designing the Minimal Structure of Hidden Markov Model by Bisimulation
Hidden Markov Models (HMMs) are an useful and widely utilized approach to the modeling of data sequences. One of the problems related to this technique is finding the optimal stru...
Manuele Bicego, Agostino Dovier, Vittorio Murino
JDA
2006
184views more  JDA 2006»
15 years 1 months ago
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
In this paper, we survey fully dynamic algorithms for path problems on general directed graphs. In particular, we consider two fundamental problems: dynamic transitive closure and...
Camil Demetrescu, Giuseppe F. Italiano