Sciweavers

12289 search results - page 716 / 2458
» computing 2006
Sort
View
FECS
2006
80views Education» more  FECS 2006»
15 years 8 months ago
iPOD/PDA-"casting" in a CS program with Integrated Distance Technology
This paper presents the results of a semester's experiments with producing instruction in "castable" format for iPODs and PDAs. The program involved is a non-tradit...
Kenneth Hoganson
AMC
2006
131views more  AMC 2006»
15 years 7 months ago
How much can analog and hybrid systems be proved (super-)Turing
Church thesis and its variants say roughly that all reasonable models of computation do not have more power than Turing machines. In a contrapositive way, they say that any model ...
Olivier Bournez
164
Voted
APPML
2006
71views more  APPML 2006»
15 years 7 months ago
Distance distribution of nodes in star graphs
The purpose of the paper is to provide an answer to a long standing problem to compute the distance distribution among the nodes in a star graph, i.e., to compute the exact number...
L. Wang, S. Subramanian, Shahram Latifi, Pradip K....
150
Voted
CORR
2006
Springer
98views Education» more  CORR 2006»
15 years 7 months ago
Faster Algorithms for Constructing a Concept (Galois) Lattice
In this paper, we present a fast algorithm for constructing a concept (Galois) lattice of a binary relation, including computing all concepts and their lattice order. We also prese...
Vicky Choi
CORR
2006
Springer
136views Education» more  CORR 2006»
15 years 7 months ago
Bargaining over the interference channel
In this paper we study the computation of the Nash bargaining solution for the two players, K frequency bands case, under joint FDM/TDM spectrum allocations and total power constra...
Amir Leshem, Ephraim Zehavi