681 search results - page 113 / 137 » General Polynomial Time Decomposition Algorithms |
105
Voted
IJCV
2007
15 years 11 days ago
2007
As an important geometric property of many structures or structural components, convexity plays an important role in computer vision and image understanding. In this paper, we desc...
108
click to vote
KDD
2004
ACM
16 years 25 days ago
2004
ACM
We report on an automated runtime anomaly detection method at the application layer of multi-node computer systems. Although several network management systems are available in th...
80
Voted
SODA
2010
ACM
15 years 9 months ago
2010
ACM
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
90
Voted
ATAL
2007
Springer
15 years 6 months ago
2007
Springer
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
84
Voted
PPOPP
2010
ACM
15 years 9 months ago
2010
ACM
We present a core calculus with two of X10's key constructs for parallelism, namely async and finish. Our calculus forms a convenient basis for type systems and static analys...