1688 search results - page 179 / 338 » The Complexity of Rationalizing Matchings |
198
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
192
click to vote
DAWAK
2001
Springer
15 years 10 months ago
2001
Springer
A fundamental task in multi-agent systems is matchmaking, which is to retrieve and classify service descriptions of agents that (best) match a given service request. Several approa...
179
click to vote
VRST
2006
ACM
16 years 14 hour ago
2006
ACM
Complex 3D interaction tasks require the manipulation of a large number of input parameters. Spatial input devices can be constructed such that their structure reflects the task ...
184
click to vote
BIBE
2005
IEEE
15 years 11 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
206
click to vote
PODS
1999
ACM
15 years 10 months ago
1999
ACM
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...