Sciweavers

8699 search results - page 1477 / 1740
» Elements of the Theory of Computation
Sort
View
INFOCOM
2000
IEEE
15 years 11 months 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
PODS
2000
ACM
146views Database» more  PODS 2000»
15 years 11 months ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch
AGENTCL
2000
Springer
15 years 11 months ago
Semantics of Communicating Agents Based on Deduction and Abduction
Intelligent agents in the agent language 3APL are computational entities consisting of beliefs and goals which make up their mental state. In this paper, we integrate communicatio...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...
CIKM
2000
Springer
15 years 11 months ago
Boosting for Document Routing
RankBoost is a recently proposed algorithm for learning ranking functions. It is simple to implement and has strong justifications from computational learning theory. We describe...
Raj D. Iyer, David D. Lewis, Robert E. Schapire, Y...
UIST
1999
ACM
15 years 11 months ago
The Role of Kinesthetic Reference Frames in Two-Handed Input Performance
We present experimental work which explores how the match (or mismatch) between the input space of the hands and the output space of a graphical display influences twohanded input...
Ravin Balakrishnan, Ken Hinckley
« Prev « First page 1477 / 1740 Last » Next »