Sciweavers

329 search results - page 5 / 66
» A note on the Hopf-Stiefel function
Sort
View
CHI
2010
ACM
14 years 3 months ago
NiCEBook: supporting natural note taking
In this paper, we present NiCEBook, a paper notebook that supports taking, structuring and reusing notes. Through a study of note-taking habits, we observed that different strateg...
Peter Brandl, Christoph Richter, Michael Haller
IPL
2010
82views more  IPL 2010»
13 years 7 months ago
New upper bounds on the Boolean circuit complexity of symmetric functions
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...
E. Demenkov, Arist Kojevnikov, Alexander S. Kuliko...
ICSM
2003
IEEE
14 years 1 months ago
Source Code Based Function Point Analysis for Enhancement Projects
Function point analysis is a well known established method to estimate the size of software systems and software projects. However, because it is based on functional documentation...
Steven Klusener
IPL
2010
119views more  IPL 2010»
13 years 7 months ago
Note on Max Lin-2 above Average
In the Max Lin-2 problem we are given a system S of m linear equations in n variables over F2 in which Equation j is assigned a positive integral weight wj for each j. We wish to ...
Robert Crowston, Gregory Gutin, Mark Jones
LACL
2005
Springer
14 years 2 months ago
A Note on the Complexity of Constraint Interaction: Locality Conditions and Minimalist Grammars
Locality Conditions (LCs) on (unbounded) dependencies have played a major role in the development of generative syntax ever since the seminal work by Ross [22]. Descriptively, they...
Hans-Martin Gärtner, Jens Michaelis