Sciweavers

932 search results - page 129 / 187
» Where in the Wikipedia Is That Answer
Sort
View
INFOCOM
2000
IEEE
14 years 4 days ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
CHI
2000
ACM
14 years 3 days ago
Agents to assist in finding help
When a novice needs help, often the best solution is to find a human expert who is capable of answering the novice’s questions. But often, novices have difficulty characterizing...
Adriana Santarosa Vivacqua, Henry Lieberman
HICSS
1998
IEEE
89views Biometrics» more  HICSS 1998»
14 years 16 hour ago
Managing Cognitive Overload in the Flora of North America Project
The Flora of North America (FNA) is a large-scale collaboration involving over eight hundred scientists working together to create a 30-volume compendium of all naturally occurrin...
J. Alfredo Sánchez, John L. Schnase, Kay L....
COMPGEOM
1998
ACM
13 years 12 months ago
Constructing Approximate Shortest Path Maps in Three Dimensions
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
Sariel Har-Peled
DIS
1998
Springer
13 years 12 months ago
Uniform Characterizations of Polynomial-Query Learnabilities
We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustivene...
Yosuke Hayashi, Satoshi Matsumoto, Ayumi Shinohara...