Sciweavers

12946 search results - page 2503 / 2590
» Natural Language Processing
Sort
View
FOCS
1999
IEEE
15 years 10 months ago
Near-Optimal Conversion of Hardness into Pseudo-Randomness
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson
SIGCOMM
1999
ACM
15 years 10 months ago
Routing with a Clue
We suggest a new simple forwarding technique to speed-up IP destination address lookup. The technique is a natural extension of IP, requires 5 bits in the IP header (IPv4, 7 in IP...
Anat Bremler-Barr, Yehuda Afek, Sariel Har-Peled
SIGIR
1999
ACM
15 years 10 months ago
SCAN: Designing and Evaluating User Interfaces to Support Retrieval From Speech Archives
Previous examinations of search in textual archives have assumed that users first retrieve a ranked set of documents relevant to their query, and then visually scan through these ...
Steve Whittaker, Julia Hirschberg, John Choi, Dona...
ECAL
1999
Springer
15 years 10 months ago
Dynamical Systems Game
The “social dilemma” is a problem inherent in forming and maintaining cooperation among selfish individuals, and is of fundamental importance in the biological and social sci...
Eizo Akiyama, Kunihiko Kaneko
INFOCOM
1998
IEEE
15 years 10 months ago
QoS Routing in Networks with Uncertain Parameters
We consider the problem of routing connections with quality of service (QoS) requirements across networks when the information available for making routing decisions is inaccurate....
Dean H. Lorenz, Ariel Orda
« Prev « First page 2503 / 2590 Last » Next »