Sciweavers

150 search results - page 30 / 30
» Solving Small TSPs with Constraints
Sort
View
DAC
1994
ACM
13 years 8 months ago
Optimum Functional Decomposition Using Encoding
In this paper, we revisit the classical problem of functional decomposition [1, 2] that arises so often in logic synthesis. One basic problem that has remained largely unaddressed...
Rajeev Murgai, Robert K. Brayton, Alberto L. Sangi...
IJCAI
1997
13 years 6 months ago
Change, Change, Change: Three Approaches
We consider the frame problem, that is, char­ acterizing the assumption that properties tend to persist over time. We show that there are at least three distinct assumptions that...
Tom Costello
ESA
2010
Springer
246views Algorithms» more  ESA 2010»
13 years 6 months ago
Estimating the Average of a Lipschitz-Continuous Function from One Sample
We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore...
Abhimanyu Das, David Kempe
MOBICOM
2010
ACM
13 years 5 months ago
Indoor localization without the pain
While WiFi-based indoor localization is attractive, the need for a significant degree of pre-deployment effort is a key challenge. In this paper, we ask the question: can we perfo...
Krishna Chintalapudi, Anand Padmanabha Iyer, Venka...
CSL
2010
Springer
13 years 4 months ago
Speech separation using speaker-adapted eigenvoice speech models
We present a system for model-based source separation for use on single channel speech mixtures where the precise source characteristics are not known a priori. The sources are mo...
Ron J. Weiss, Daniel P. W. Ellis