Sciweavers

1046 search results - page 69 / 210
» Approximation Algorithms for Domination Search
Sort
View
ATAL
2010
Springer
14 years 7 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...
86
Voted
LREC
2010
157views Education» more  LREC 2010»
15 years 1 months ago
Indexing Methods for Faster and More Effective Person Name Search
This paper compares several indexing methods for person names extracted from text, developed for an information retrieval system with requirements for fast approximate matching of...
Mark Arehart
ICDE
1996
IEEE
142views Database» more  ICDE 1996»
16 years 1 months ago
Approximate Queries and Representations for Large Data Sequences
Many new database application domains such as experimental sciences and medicine are characterized by large sequences as their main form of data. Using approximate representation ...
Hagit Shatkay, Stanley B. Zdonik
WWW
2003
ACM
16 years 1 months ago
A Context-Based Information Agent for Supporting Intelligent Distance Learning Environments
The large amount of information now available on the Web can play a prominent role in building a cooperative intelligent distance learning environment. We propose a system to prov...
Mohammed Abdel Razek, Claude Frasson, Marc Kaltenb...
CVPR
2009
IEEE
16 years 7 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...