Sciweavers

4940 search results - page 106 / 988
» On the Complexity of Universal Programs
Sort
View
IIE
2006
183views more  IIE 2006»
15 years 4 months ago
Desktop Tools for Offline Plagiarism Detection in Computer Programs
Plagiarism in universities has always been a difficult problem to overcome. Various tools have been developed over the past few years to help teachers detect plagiarism in students...
Maxim Mozgovoy
CVPR
2009
IEEE
2452views Computer Vision» more  CVPR 2009»
16 years 11 months ago
CHoG: Compressed Histogram of Gradients: A Low Bit-Rate Feature Descriptor
Establishing visual correspondences is an essential component of many computer vision problems, and is often done with robust, local feature-descriptors. Transmission and storag...
Vijay Chandrasekhar (Stanford University), Gabriel...
SAS
2000
Springer
15 years 8 months ago
Flattening Is an Improvement
d Abstract) James Riely1 and Jan Prins2 1 DePaul University 2 University of North Carolina at Chapel Hill Abstract. Flattening is a program transformation that eliminates nested pa...
James Riely, Jan Prins
EDM
2009
132views Data Mining» more  EDM 2009»
15 years 2 months ago
Predicting Students Drop Out: A Case Study
The monitoring and support of university freshmen is considered very important at many educational institutions. In this paper we describe the results of the educational data minin...
Gerben Dekker, Mykola Pechenizkiy, Jan Vleeshouwer...
IPPS
2002
IEEE
15 years 9 months ago
Program Composition in Isabelle/UNITY
We describe the mechanization of recent examples of compositional reasoning, due to Charpentier and Chandy [4]. The examples illustrate a new theory for composition proposed by Ch...
Sidi O. Ehmety, Lawrence C. Paulson