Sciweavers

15351 search results - page 2985 / 3071
» The information bottleneck method
Sort
View
IUI
1993
ACM
13 years 11 months ago
Wizard of Oz studies: why and how
We discuss current approaches to the development of natural language dialogue systems, and claim that they do not sufficiently consider the unique qualities of man-machine intera...
Nils Dahlbäck, Arne Jönsson, Lars Ahrenb...
ECCV
1992
Springer
13 years 11 months ago
Data and Model-Driven Selection using Color Regions
A key problem in model-based object recognition is selection, namely, the problem of determining which regions in the image are likely to come from a single object. In this paper w...
Tanveer Fathima Syeda-Mahmood
SIGGRAPH
1993
ACM
13 years 11 months ago
Global visibility algorithms for illumination computations
The most expensive geometric operation in image synthesis is visibility determination. Classically this is solved with hidden surface removal algorithms that render only the parts...
Seth J. Teller, Pat Hanrahan
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
13 years 11 months ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
SIGOPSE
1990
ACM
13 years 11 months ago
A replicated Unix file system
u s e s t h e p r i m a r y c o p y r e p l i c a t i o nAbstract technique [1, 26, 27]. In this method, client calls are directed to a single primary server, which communicatesThi...
Barbara Liskov, Robert Gruber, Paul Johnson, Liuba...
« Prev « First page 2985 / 3071 Last » Next »