Search
Now showing items 21-30 of 111
Determining articulator configuration in voiced stop consonants by matching time-domain patterns in pitch periods
(2005-01-28)
In this thesis I will be concerned with linking the observed speechsignal to the configuration of articulators.Due to the potentially rapid motion of the articulators, the speechsignal can be highly non-stationary. The ...
Using computational models to study texture representations in the human visual system.
(2005-02-07)
Traditionally, human texture perception has been studied using artificial textures made of random-dot patterns or abstract structured elements. At the same time, computer algorithms for the synthesis of natural textures ...
Discovering object categories in image collections
(2005-02-25)
Given a set of images containing multiple object categories,we seek to discover those categories and their image locations withoutsupervision. We achieve this using generative modelsfrom the statistical text literature: ...
Impossibility of boosting distributed service resilience
(2005-02-25)
We prove two theorems saying that no distributed system in whichprocesses coordinate using reliable registers and f-resilient servicescan solve the consensus problem in the presence of f+1 undetectableprocess stopping ...
Functional Differential Geometry
(2005-02-02)
Differential geometry is deceptively simple. It is surprisingly easyto get the right answer with unclear and informal symbol manipulation.To address this problem we use computer programs to communicate aprecise understanding ...
Stable Policy Routing with Provider Independence
(2005-02-08)
Thousands of competing autonomous systems (ASes) mustcooperate with each other to provide global Internet connectivity.These ASes encode various economic, business,and performance decisions in their routing policies. The ...
Improving 802.11 Range with Forward Error Correction
(2005-02-24)
The ISO/IEC 8802-11:1999(E) specification uses a 32-bit CRC for error detection and whole-packet retransmissions for recovery. In long-distance orhigh-interference links where the probability of a bit error is high,this ...
The Security Power of the Ballot Box
(2005-02-02)
We show that any function F can be securely evaluated by a protocolwith ballots and a ballot box. That is, N mutually suspicious players,each player possessing a secret input, can use ballots and a ballotbox to jointly ...
Complexity of finding Nash equilibria in 0-1 bimatrix games
(2005-02-08)
We exhibit a polynomial reduction from the problem of finding a Nashequilibrium of a bimatrix game with rational coefficients to the problemof finding a Nash equilibrium of a bimatrix game with 0-1 coefficients.
Self-Stabilizing Mobile Node Location Management and Message
(2005-08-11)
We present simple algorithms for achieving self-stabilizing locationmanagement and routing in mobile ad-hoc networks. While mobile clients maybe susceptible to corruption and stopping failures, mobile networks areoften ...