Sciweavers

2223 search results - page 157 / 445
» Ontological Framework for Approximation
Sort
View
CIKM
2004
Springer
15 years 11 months ago
Framework and algorithms for trend analysis in massive temporal data sets
Mining massive temporal data streams for significant trends, emerging buzz, and unusually high or low activity is an important problem with several commercial applications. In th...
Sreenivas Gollapudi, D. Sivakumar
CIAC
2010
Springer
194views Algorithms» more  CIAC 2010»
15 years 11 months ago
An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences
A weighted sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. A common task is to locate a given motif in a ...
Hui Zhang, Qing Guo, Costas S. Iliopoulos
CG
2008
Springer
15 years 6 months ago
A simple and flexible framework to adapt dynamic meshes
Many graphics applications represent deformable surfaces through dynamic meshes. To be consistent during deformations, the dynamic meshes require an adaptation process. In this pa...
Fernando de Goes, Siome Goldenstein, Luiz Velho
ICMCS
2009
IEEE
149views Multimedia» more  ICMCS 2009»
15 years 4 months ago
A multi-agent framework for a hybrid dialog management system
The importance of dialog management systems has increased in recent years. Dialog systems are created for domain specific applications, so that a high demand for a flexible dialog...
Stefan Schwärzler, Joachim Schenk, Günth...
ICFP
2003
ACM
16 years 6 months ago
Representing reductions of NP-complete problems in logical frameworks: a case study
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
Carsten Schürmann, Jatin Shah