Sciweavers

4940 search results - page 200 / 988
» On the Complexity of Universal Programs
Sort
View
ACSC
2002
IEEE
15 years 11 months ago
Learning and the Reflective Journal in Computer Science
This paper describes the use of the reflective journal in a computer programming course at the University of South Australia. We describe rationale for the journal relating it to ...
S. E. George
CIB
2005
41views more  CIB 2005»
15 years 6 months ago
A Partial-Repeatability Approach to Data Mining
Unlike the data approached in traditional data mining activities, software data are featured with partial-repeatability or parepeatics, which is an invariant property that can neit...
Kai-Yuan Cai, Yunfei Yin, Shichao Zhang
LPAR
2012
Springer
14 years 1 months ago
Lazy Abstraction with Interpolants for Arrays
traction with Interpolants for Arrays Francesco Alberti1 , Roberto Bruttomesso2 , Silvio Ghilardi2 , Silvio Ranise3 , Natasha Sharygina1 1 Universit`a della Svizzera Italiana, Luga...
Francesco Alberti, Roberto Bruttomesso, Silvio Ghi...
ICIP
2008
IEEE
16 years 8 months ago
Coding-gain-based complexity control for H.264 video encoder
The allowable computational complexity of video encoding is limited in a power-constrained system. Different video frames are associated with different motions and contexts, and s...
Ming-Chen Chien, Zong-Yi Chen, Pao-Chi Chang
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
15 years 10 months ago
On the Communication Complexity of Read-Once AC^0 Formulae
Abstract--We study the 2-party randomized communication complexity of read-once AC0 formulae. For balanced AND-OR trees T with n inputs and depth d, we show that the communication ...
T. S. Jayram, Swastik Kopparty, Prasad Raghavendra