697 search results - page 34 / 140 » Approximation of Information Granule Sets |
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...
196
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
IJCAI
2007
15 years 1 months ago
2007
In recent years, metric learning in the semisupervised setting has aroused a lot of research interests. One type of semi-supervised metric learning utilizes supervisory informatio...
100
click to vote
JCP
2007
14 years 11 months ago
2007
Abstract— Data synopsis is a lossy compressed representation of data stored into databases that helps the query optimizer to speed up the query process, e.g. time to retrieve the...
140
click to vote
ICALP
2001
Springer
15 years 4 months ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...