5606 search results - page 242 / 1122 » Randomization Techniques for Graphs. |
110
Voted
ACL
2009
14 years 11 months ago
2009
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
95
Voted
ASIACRYPT
2008
Springer
15 years 3 months ago
2008
Springer
Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the...
113
Voted
P2P
2007
IEEE
15 years 7 months ago
2007
IEEE
To achieve higher efficiency over their unstructured counterparts, structured peer-to-peer systems hold each node responsible for serving a specified set of keys and correctly r...
127
Voted
ICMCS
2000
IEEE
15 years 5 months ago
2000
IEEE
: In the process of transmission of digital encoded video bit streams over physical network, the data is corrupted by random bit errors, which has a several effect on the decoded v...
109
Voted
AAAI
2004
15 years 2 months ago
2004
Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks; conditions w...