Sciweavers

2520 search results - page 123 / 504
» The complexity of approximating entropy
Sort
View
ICDE
2004
IEEE
102views Database» more  ICDE 2004»
15 years 12 months ago
Approximate Temporal Aggregation
Temporal aggregate queries retrieve summarized information about records with time-evolving attributes. Existing approaches have at least one of the following shortcomings: (i) th...
Yufei Tao, Dimitris Papadias, Christos Faloutsos
ICML
2009
IEEE
15 years 11 months ago
Approximate inference for planning in stochastic relational worlds
Relational world models that can be learned from experience in stochastic domains have received significant attention recently. However, efficient planning using these models rema...
Tobias Lang, Marc Toussaint
ICML
2005
IEEE
15 years 11 months ago
Learning as search optimization: approximate large margin methods for structured prediction
Mappings to structured output spaces (strings, trees, partitions, etc.) are typically learned using extensions of classification algorithms to simple graphical structures (eg., li...
Daniel Marcu, Hal Daumé III
VLDB
2002
ACM
113views Database» more  VLDB 2002»
15 years 10 months ago
Searching in metric spaces by spatial approximation
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...
Gonzalo Navarro
CMSB
2009
Springer
15 years 5 months ago
Probabilistic Approximations of Signaling Pathway Dynamics
Systems of ordinary differential equations (ODEs) are often used to model the dynamics of complex biological pathways. We construct a discrete state model as a probabilistic appro...
Bing Liu, P. S. Thiagarajan, David Hsu