Sciweavers

2941 search results - page 270 / 589
» The Myth of the Educational Computer
Sort
View
CORR
2006
Springer
164views Education» more  CORR 2006»
15 years 6 months ago
Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
Bodo Manthey
156
Voted
CORR
2007
Springer
93views Education» more  CORR 2007»
15 years 6 months ago
Intrinsic dimension of a dataset: what properties does one expect?
— We propose an axiomatic approach to the concept of an intrinsic dimension of a dataset, based on a viewpoint of geometry of high-dimensional structures. Our first axiom postul...
Vladimir Pestov
CORR
2007
Springer
68views Education» more  CORR 2007»
15 years 6 months ago
An Improved Tight Closure Algorithm for Integer Octagonal Constraints
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
Roberto Bagnara, Patricia M. Hill, Enea Zaffanella
165
Voted
CORR
2007
Springer
116views Education» more  CORR 2007»
15 years 6 months ago
Cooperative game theory and the Gaussian interference channel
—In this paper we discuss the use of cooperative game theory for analyzing interference channels. We extend our previous work, to games with N players as well as frequency select...
Amir Leshem, Ephraim Zehavi
CORR
2007
Springer
95views Education» more  CORR 2007»
15 years 6 months ago
Solving the subset-sum problem with a light-based device
We propose a special computational device which uses light rays for solving the subset-sum problem. The device has a graph-like representation and the light is traversing it by fol...
Mihai Oltean, Oana Muntean