Sciweavers

CORR
2010
Springer
62views Education» more  CORR 2010»
13 years 11 months ago
Twenty Questions Games Always End With Yes
Huffman coding is often presented as the optimal solution to Twenty Questions. However, a caveat is that Twenty Questions games always end with a reply of "Yes," whereas ...
John T. Gill III, William Wu
CORR
2010
Springer
122views Education» more  CORR 2010»
13 years 11 months ago
A Unified Algorithmic Framework for Multi-Dimensional Scaling
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is mo...
Arvind Agarwal, Jeff M. Phillips, Suresh Venkatasu...
CORR
2010
Springer
64views Education» more  CORR 2010»
13 years 11 months ago
A Trustability Metric for Code Search based on Developer Karma
The promise of search-driven development is that developers will save time and resources by reusing external code in their local projects. To efficiently integrate this code, user...
Florian S. Gysin, Adrian Kuhn
CORR
2010
Springer
77views Education» more  CORR 2010»
13 years 11 months ago
Triangular Decomposition of Semi-algebraic Systems
Regular chains and triangular decompositions are fundamental and well-developed tools for describing the complex solutions of polynomial systems. This paper proposes adaptations o...
Changbo Chen, James H. Davenport, John P. May, Mar...
CORR
2010
Springer
134views Education» more  CORR 2010»
13 years 11 months ago
On the order bound for one-point AG codes
The order bound for the minimum distance of algebraic geometry codes is defined for the dual of one-point codes. A new bound for the minimum distance of linear codes, and for codes...
Olav Geil, Carlos Munuera, Diego Ruano, Fernando T...
CORR
2010
Springer
149views Education» more  CORR 2010»
13 years 11 months ago
Pebbling and Branching Programs Solving the Tree Evaluation Problem
We study restricted computation models related to the tree evaluation problem. The TEP was introduced in earlier work as a simple candidate for the (very) long term goal of separa...
Dustin Wehr
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 11 months ago
Bounded Rationality, Strategy Simplification, and Equilibrium
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
Hubie Chen
CORR
2010
Springer
60views Education» more  CORR 2010»
13 years 11 months ago
A Novel Scheme for Secured Data Transfer Over Computer Networks
: This paper presents a novel encryption-less algorithm to enhance security in transmission of data in networks. The algorithm uses an intuitively simple idea of a `jigsaw puzzle&#...
Rangarajan Vasudevan, Ajith Abraham, Sugata Sanyal
CORR
2010
Springer
120views Education» more  CORR 2010»
13 years 11 months ago
State machine models of timing and circuit design
This paper illustrates a technique for specifying the detailed timing, logical operation, and compositional circuit design of digital circuits in terms of ordinary state machines w...
Victor Yodaiken
CORR
2010
Springer
221views Education» more  CORR 2010»
13 years 11 months ago
Deterministic Sample Sort For GPUs
We present and evaluate GPU Bucket Sort, a parallel deterministic sample sort algorithm for many-core GPUs. Our method is considerably faster than Thrust Merge (Satish et.al., Pro...
Frank Dehne, Hamidreza Zaboli