12519 search results - page 421 / 2504 » Approximation Problems Categories |
172
click to vote
ICDM
2007
IEEE
16 years 1 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...
196
click to vote
VLDB
2005
ACM
16 years 9 days ago
2005
ACM
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
174
click to vote
VLDB
1998
ACM
15 years 11 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...
209
click to vote
AAAI
2006
15 years 8 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...
179
Voted
SODA
2000
ACM
15 years 8 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...