363 search results - page 18 / 73 » Finding Small Solutions to Small Degree Polynomials |
AAAI
1990
13 years 8 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
PODS
2005
ACM
14 years 7 months ago
2005
ACM
The challenge of monitoring massive amounts of data generated by communication networks has led to the interest in data stream processing. We study streams of edges in massive com...
COLT
1999
Springer
13 years 12 months ago
1999
Springer
We propose a new boosting algorithm. This boosting algorithm is an adaptive version of the boost by majority algorithm and combines bounded goals of the boost by majority algorith...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
CVPR
2006
IEEE
14 years 9 months ago
2006
IEEE
Interactive digital matting, the process of extracting a foreground object from an image based on limited user input, is an important task in image and video editing. From a compu...