4117 search results - page 628 / 824 » On the Satisfiability of Complex Constraints |
146
Voted
AIPS
2003
15 years 8 months ago
2003
We present economically augmented job shop scheduling (EJSP) as an example of a coordination problem among selfinterested agents with private information. We discuss its signific...
168
click to vote
NIPS
2004
15 years 8 months ago
2004
This paper proposes a method for computing fast approximations to support vector decision functions in the field of object detection. In the present approach we are building on an...
177
click to vote
SODA
2004
ACM
15 years 8 months ago
2004
ACM
We prove that any one-pass streaming algorithm which ( , )-approximates the kth frequency moment Fk, for any real k = 1 and any = 1 m , must use 1 2 bits of space, where m is th...
167
click to vote
ESM
2000
15 years 8 months ago
2000
A very active field of research of Database Management Systems (DBMS) is concerned with an augmentation of DBMS by rules. Passive rules (constraints) were the first to be investig...
155
click to vote
MVA
1998
15 years 8 months ago
1998
In this paper the analysis of gray level corner detection has been carried out. Performances of various cornerness measures are discussed with respect to four performances of robu...