Sciweavers

728 search results - page 89 / 146
» New Directions in Question Answering
Sort
View
STOC
1991
ACM
93views Algorithms» more  STOC 1991»
15 years 3 months ago
Rounds in Communication Complexity Revisited
The k-round two-party communication complexity was studied in the deterministic model by [14] and [4] and in the probabilistic model by [20] and [6]. We present new lower bounds th...
Noam Nisan, Avi Wigderson
BIRTHDAY
2005
Springer
15 years 5 months ago
Splitting Logics
This paper addresses the question of factoring a logic into families of (generally simpler) components, estimating the top– down perspective, splitting, versus the bottom–up, s...
Walter Alexandre Carnielli, Marcelo E. Coniglio
ICDCS
2009
IEEE
15 years 9 months ago
On the Utility of Inference Mechanisms
A number of network path delay, loss, or bandwidth inference mechanisms have been proposed over the past decade. Concurrently, several network measurement services have been deplo...
Ethan Blanton, Sonia Fahmy, Greg N. Frederickson
SPEECH
2002
112views more  SPEECH 2002»
14 years 11 months ago
Relating dialogue games to information state
This paper1 discusses the use of `conversational' or `dialogue games' as a basis for building dialogue systems. We give a tutorial overview of some recent attempts to re...
Stephen G. Pulman
TMC
2010
158views more  TMC 2010»
14 years 10 months ago
Secure Distance-Based Localization in the Presence of Cheating Beacon Nodes
—Secure distance-based localization in the presence of cheating beacon (or anchor) nodes is an important problem in mobile wireless ad hoc and sensor networks. Despite significa...
Murtuza Jadliwala, Sheng Zhong, Shambhu J. Upadhya...