3270 search results - page 159 / 654 » Approximate String Processing |
153
click to vote
AUTOMATICA
2008
15 years 2 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
116
click to vote
ICDM
2007
IEEE
15 years 8 months ago
2007
IEEE
Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, deman...
130
Voted
VLDB
2005
ACM
15 years 8 months ago
2005
ACM
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
126
click to vote
VLDB
1998
ACM
15 years 6 months ago
1998
ACM
Approximate predicates can be used to reduce the number of comparisons made by expensive, complex predicates. For example, to check if a point is within a region (expensive predic...
139
Voted
AAAI
2006
15 years 3 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...