Sciweavers

12193 search results - page 2389 / 2439
» It's not all about
Sort
View
PR
1998
90views more  PR 1998»
13 years 7 months ago
Supportedness and tameness differentialless geometry of plane curves
—We introduce a class of planar arcs and curves, called tame arcs, which is general enough to describe (parts of) the boundaries of planar real objects. A tame arc can have smoot...
Longin Jan Latecki, Azriel Rosenfeld
TC
1998
13 years 7 months ago
Algorithms for Variable Length Subnet Address Assignment
In a computer network that consists of M subnetworks, the L-bit address of a machine consists of two parts: A pre x si that contains the address of the subnetwork to which the mac...
Mikhail J. Atallah, Douglas Comer
SIGCSE
2002
ACM
141views Education» more  SIGCSE 2002»
13 years 7 months ago
Teaching introductory Java through LEGO MINDSTORMS models
Innovative teachers are continually looking for creative ideas, both to get their ideas across and to hold the interest of their students. One of the latest trends is the use of L...
David J. Barnes
SIGCSE
2002
ACM
134views Education» more  SIGCSE 2002»
13 years 7 months ago
Internationalization of the curriculum report of a project within computer science
In the Fall of 1999 the Center for Excellence in Undergraduate Teaching (CEUT) and the International Office at Virginia Tech provided a small grant to support the incorporation of...
John A. N. Lee
TIT
1998
90views more  TIT 1998»
13 years 7 months ago
On the Complexity of Decoding Lattices Using the Korkin-Zolotarev Reduced Basis
—Upper and lower bounds are derived for the decoding complexity of a general lattice L. The bounds are in terms of the dimension n and the coding gain of L, and are obtained ba...
Amir H. Banihashemi, Amir K. Khandani
« Prev « First page 2389 / 2439 Last » Next »