Sciweavers

1802 search results - page 334 / 361
» Complexity Theory for Operators in Analysis
Sort
View
CSDA
2006
84views more  CSDA 2006»
15 years 5 months ago
Performing hypothesis tests on the shape of functional data
We explore different approaches for performing hypothesis tests on the shape of a mean function by developing general methodologies both, for the often assumed, i.i.d. error struc...
Gareth M. James, Ashish Sood
JACM
2006
99views more  JACM 2006»
15 years 5 months ago
Finding a maximum likelihood tree is hard
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
Benny Chor, Tamir Tuller
159
Voted
SOFTWARE
2008
15 years 4 months ago
What Do We Know about Developer Motivation?
s of titles and abstracts) as irrelevant to our focus. We read the remaining 519 papers in full to establish our final list. The 92 papers we chose were originally published in the...
Tracy Hall, Helen Sharp, Sarah Beecham, Nathan Bad...
JSYML
2007
100views more  JSYML 2007»
15 years 4 months ago
Combinatorial principles weaker than Ramsey's Theorem for pairs
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
Denis R. Hirschfeldt, Richard A. Shore
ISR
2010
15 years 3 months ago
Electronic Markets, Search Costs, and Firm Boundaries
We study how electronic markets that facilitate broader inter-firm transactions affect the vertical scope of emerging IT-enabled extended enterprises. We do so by modeling firms...
Ramesh Sankaranarayanan, Arun Sundararajan