Sciweavers

2693 search results - page 123 / 539
» On Computing Complex Navigation Functions
Sort
View
104
Voted
ECCC
2008
108views more  ECCC 2008»
15 years 2 months ago
The Complexity of Rationalizing Matchings
Given a set of observed economic choices, can one infer preferences and/or utility functions for the players that are consistent with the data? Questions of this type are called r...
Shankar Kalyanaraman, Christopher Umans
SIGDIAL
2010
15 years 7 days ago
Dialogue Act Modeling in a Complex Task-Oriented Domain
Classifying the dialogue act of a user utterance is a key functionality of a dialogue management system. This paper presents a data-driven dialogue act classifier that is learned ...
Kristy Elizabeth Boyer, Eun Y. Ha, Robert Phillips...
94
Voted
DAC
2004
ACM
16 years 3 months ago
Reliability-driven layout decompaction for electromigration failure avoidance in complex mixed-signal IC designs
The negative effect of electromigration on signal and power line lifetime and functional reliability is an increasingly important problem for the physical design of integrated cir...
Goeran Jerke, Jürgen Scheible, Jens Lienig
113
Voted
ICALP
2003
Springer
15 years 7 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 7 days ago
Complexity Bounds for Batch Active Learning in Classification
Active learning [1] is a branch of Machine Learning in which the learning algorithm, instead of being directly provided with pairs of problem instances and their solutions (their l...
Philippe Rolet, Olivier Teytaud