Results 1  10
of
2,667
Seth Teller
, 2009
"... Autonomous ground vehicles, or selfdriving cars, require a high level of situational awareness in order to operate safely and efficiently in realworld conditions. A system able to quickly and reliably estimate the location of the roadway and its lanes based upon local sensor data would be a valuab ..."
Abstract
 Add to MetaCart
Autonomous ground vehicles, or selfdriving cars, require a high level of situational awareness in order to operate safely and efficiently in realworld conditions. A system able to quickly and reliably estimate the location of the roadway and its lanes based upon local sensor data would be a valuable asset both to fully autonomous vehicles as well as driver assistance technologies. To be most useful, the system must accommodate a variety of roadways, a range of weather and lighting conditions, and highly dynamic scenes with other vehicles and moving objects. Lane estimation can be modeled as a curve estimation problem, where sensor data provides partial and noisy observations of curves. The number of curves to estimate may be initially unknown and many of the observations may be outliers and false detections (e.g., due to tree shadows or lens flare). The challenge is to detect lanes when and where they exist, and to update the lane estimates as new observations are received. This thesis describes algorithms for feature detection and curve estimation, as
Michel POCCHIOLA Reviewer Seth TELLER Reviewer
"... Dissertation presented in partial fulfillement of the requirements for the degree of ..."
Abstract
 Add to MetaCart
Dissertation presented in partial fulfillement of the requirements for the degree of
Sharad Seth 2 Analysis and Taxonomy of Column Header Categories for Web Tables
"... We describe a component of a document analysis system for constructing ontologies for domainspecific web tables imported into Excel. This component automates extraction of the Wang Notation for the column header of a table. Using columnheader specific rules for XY cutting we convert the geometric ..."
Abstract
 Add to MetaCart
We describe a component of a document analysis system for constructing ontologies for domainspecific web tables imported into Excel. This component automates extraction of the Wang Notation for the column header of a table. Using columnheader specific rules for XY cutting we convert the geometric structure of the column header to a linear string denoting cell attributes and directions of cuts. The string representation is parsed by a contextfree grammar and the parse tree is further processed to produce an abstract datatype representation (the Wang notation tree) of each column category. Experiments were carried out to evaluate this scheme on the original and edited column headers of Excel tables drawn from a collection of 200 used in our earlier work. The transformed headers were obtained by editing the original column headers to conform to the format targeted by our grammar. Fortyfour original headers and their reformatted versions were submitted as input to our software system. Our grammar was able to parse and the extract Wang notation tree for all the edited headers, but for only four of the original headers. We suggest extensions to our table grammar that would enable processing a larger fraction of headers without manual editing.
ARTICLE Communicated by Seth Herd A Neural Network Model of the Eriksen Task: Reduction, Analysis, and Data Fitting
"... We analyze a neural networkmodel of the Eriksen task: a twoalternative forcedchoice task inwhich subjectsmust correctly identify a central stimulus and disregard flankers that may or may not be compatible with it. We linearize and decouple the model, deriving a reduced driftdiffusion process wit ..."
Abstract
 Add to MetaCart
We analyze a neural networkmodel of the Eriksen task: a twoalternative forcedchoice task inwhich subjectsmust correctly identify a central stimulus and disregard flankers that may or may not be compatible with it. We linearize and decouple the model, deriving a reduced driftdiffusion process with variable drift rate that describes the accumulation of net evidence in favor of either alternative, and we use this to analytically describehowaccuracy and response timedata dependonmodel parameters. Such analyses both assist parameter tuning in network models and suggest explanationsof changingdrift rates in termsof attention.Wecompare our results with numerical simulations of the full nonlinear model and with empirical data and show good fits to both with fewer parameters.
Vector Meson Masses in AdS/QCD
, 2013
"... We study the antide Sitter/conformal field theory correspondence (AdS/CFT correspondence) and investigate in a scalar model how n point functions can be calculated through functional derivatives and how they can be obtained with the use of Witten diagrams instead. We also study a previous antide S ..."
Abstract
 Add to MetaCart
We study the antide Sitter/conformal field theory correspondence (AdS/CFT correspondence) and investigate in a scalar model how n point functions can be calculated through functional derivatives and how they can be obtained with the use of Witten diagrams instead. We also study a previous antide Sitter/quantum chromodynamics (AdS/QCD) model where the mass of the φ meson has not been considered. It turns out to be equivalent to the mass of the ρ meson. A fact that is not supported experimentally. In an attempt to obtain better results for the φ meson mass we do a slight modification to the existing model. However our modifications led to computational difficulties and although some results could be obtained none agreed well with experimental data. ii Contents
Embedding Metric Spaces in the Rectilinear Plane: a SixPoint Criterion
, 1996
"... We show that a metric space embeds in the rectilinear plane (i.e., is L 1embeddable in R²) if and only if every subspace with five or six points does. A simple construction shows that for higher dimensions k of the host rectilinear space the number c(k) of points that need to be tested grows at le ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
at least quadratically with k, thus disproving a conjecture of Seth and Jerome Malitz.
DISS. ETH NO. 19589 Termination Analysis for BitVector Programs
, 2011
"... Recent advances in software termination analysis have shown that program termination can be decided efficiently for many practically relevant problems, despite the fact that the Halting Problem in general is undecidable. This dissertation presents a new algorithm for termination analysis, called Co ..."
Abstract
 Add to MetaCart
Compositional Termination Analysis, which is based on compositional (or transitive) transition invariants. This algorithm depends on an underlying ranking relation synthesis engine and this dissertation presents two such engines that are able to synthesize BitVector ranking relations. This class
Toward more efficient motion planning with differential constraints
, 2007
"... Agents with differential constraints, although common in the real world, pose a particular difficulty for motion planning algorithms. Methods for solving such problems are still relatively slow and inefficient. In particular, current motion planners generally can neither “see ” the world around them ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Agents with differential constraints, although common in the real world, pose a particular difficulty for motion planning algorithms. Methods for solving such problems are still relatively slow and inefficient. In particular, current motion planners generally can neither “see ” the world around them, nor generalize from experience. That is, their reliance on collision tests as the only means of sensing the environment yields a tactile, myopic perception of the world. Such shortsightedness greatly limits any potential for detection, learning, or reasoning about frequently encountered situations. In result these methods solve each problem in exactly the same way, whether the first or the hundredth time they attempt it, each time none the wiser. The key component of this thesis proposes a general approach for motion planning in which local sensory information, in conjunction with prior accumulated experience, are exploited to improve planner performance. The approach relies on learning viability models for the agent’s “perceptual space”, and the use thereof to direct planning effort. In addition, a method is presented for improving runtimes of the RRT motion planning algorithm in heavily constrained searchspaces, a common feature for agents
DO MORE MERGERS AND ACQUISITIONS CREATE VALUE FOR THE FIRM?
, 2015
"... This thesis is aimed to empirically investigate the performance impact of frequent acquisitions as an aggressive merger and acquisition (M&A) strategy for an acquiring firm. In literature related to the study of M&A, a common question is whether acquisitions improve the performance of acquir ..."
Abstract
 Add to MetaCart
performance. On the basis of a large sample that consists of about 14,000 acquisitions from more than 100 countries over last 12 years, the thesis finds that the investors perceive a lower value if the acquiring firm is involved in frequent mergers. This is because more
Results 1  10
of
2,667