Sciweavers

2100 search results - page 76 / 420
» Fundamentals of the problem
Sort
View
AAAI
2011
12 years 10 months ago
Convex Sparse Coding, Subspace Learning, and Semi-Supervised Extensions
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
Xinhua Zhang, Yaoliang Yu, Martha White, Ruitong H...
SIGCSE
2010
ACM
175views Education» more  SIGCSE 2010»
14 years 3 months ago
MPCT: media propelled computational thinking
Media-Propelled Computational Thinking (MPCT – pronounced impact) is a course designed to introduce programming in the context of engaging problems in media computation, math, a...
Eric Andrew Freudenthal, Mary K. Roy, Alexandria N...
ADBIS
2000
Springer
82views Database» more  ADBIS 2000»
14 years 2 months ago
A New Algorithm for Page Access Sequencing in Join Processing
Abstract. One of the fundamental problems in relational database management is the handling of the join operation. Two of the problems are: 1) finding a page access sequence which...
Andrew Lim, Wee-Chong Oon, Chi-Hung Chi
IPCO
2010
160views Optimization» more  IPCO 2010»
13 years 11 months ago
On Column-Restricted and Priority Covering Integer Programs
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...
Deeparnab Chakrabarty, Elyot Grant, Jochen Kö...
RSA
1998
54views more  RSA 1998»
13 years 9 months ago
Random disease on the square grid
We introduce some generalizations of a nice combinatorial problem, the central notion of which is the so-called Disease Process. Let us color independently each square of an n×n c...
József Balogh, Gábor Pete