Sciweavers

4926 search results - page 526 / 986
» Two Graph Algorithms On an Associative Computing Model
Sort
View
WADS
2009
Springer
291views Algorithms» more  WADS 2009»
15 years 10 months ago
On the Power of the Semi-Separated Pair Decomposition
Abstract. A Semi-Separated Pair Decomposition (SSPD), with parameter s > 1, of a set S ⊂ Rd is a set {(Ai, Bi)} of pairs of subsets of S such that for each i, there are balls ...
Mohammad Ali Abam, Paz Carmi, Mohammad Farshi, Mic...
162
Voted
ACII
2011
Springer
14 years 3 months ago
Exploring the Relationship between Novice Programmer Confusion and Achievement
Abstract. Using a discovery-with-models approach, we study the relationships between novice Java programmers’ experiences of confusion and their achievement, as measured through ...
Diane Marie C. Lee, Ma. Mercedes T. Rodrigo, Ryan ...
123
Voted
IANDC
2006
121views more  IANDC 2006»
15 years 3 months ago
Comparing operational models of name-passing process calculi
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
Marcelo P. Fiore, Sam Staton
131
Voted
PPSN
1992
Springer
15 years 7 months ago
Hyperplane Annealing and Activator-Inhibitor-Systems
This paper introduces a new optimization technique called hyperplane annealing. It is similar to the mean field annealing approach to combinatorial optimization. Both annealing te...
Thomas Laußermair
ICPR
2004
IEEE
16 years 4 months ago
Large Scale Feature Selection Using Modified Random Mutation Hill Climbing
Feature selection is a critical component of many pattern recognition applications. There are two distinct mechanisms for feature selection, namely the wrapper method and the filt...
Anil K. Jain, Michael E. Farmer, Shweta Bapna