Sciweavers

3244 search results - page 332 / 649
» On convex complexity measures
Sort
View
ITICSE
2004
ACM
16 years 5 days ago
Program quality with pair programming in CS1
Prior research on pair programming has found that compared to students who work alone, students who pair have shown increased confidence in their work, greater success in CS1, an...
Brian Hanks, Charlie McDowell, David Draper, Milov...
SC
2004
ACM
16 years 4 days ago
The Potential of Computation Regrouping for Improving Locality
Improving program locality has become increasingly important on modern computer systems. An effective strategy is to group computations on the same data so that once the data are ...
Chen Ding, Maksim Orlovich
ECCV
2004
Springer
16 years 3 days ago
Unbiased Errors-In-Variables Estimation Using Generalized Eigensystem Analysis
Recent research provided several new and fast approaches for the class of parameter estimation problems that are common in computer vision. Incorporation of complex noise model (mo...
Matthias Mühlich, Rudolf Mester
SETA
2004
Springer
79views Mathematics» more  SETA 2004»
16 years 2 days ago
A Survey of the Merit Factor Problem for Binary Sequences
A classical problem of digital sequence design, first studied in the 1950s but still not well understood, is to determine those binary sequences whose aperiodic autocorrelations ...
Jonathan Jedwab
SWAT
2004
Springer
136views Algorithms» more  SWAT 2004»
16 years 2 days ago
The Relative Worst Order Ratio Applied to Seat Reservation
The seat reservation problem is the problem of assigning passengers to seats on a train with n seats and k stations enroute in an online manner. The performance of algorithms for t...
Joan Boyar, Paul Medvedev