Sciweavers

6300 search results - page 180 / 1260
» We have it easy, but do we have it right
Sort
View
CG
2005
Springer
15 years 1 months ago
LADDER, a sketching language for user interface developers
Sketch recognition systems are currently being developed for many domains, but can be time consuming to build if they are to handle the intricacies of each domain. In order to aid...
Tracy Hammond, Randall Davis
COMCOM
2004
111views more  COMCOM 2004»
15 years 1 months ago
An adaptive scheduling algorithm for differentiated services on WDM optical networks
One of the important issues in the design of future generation high-speed networks is to provide differentiated services to different types of applications with various time const...
Maode Ma, Mounir Hamdi
ESA
2005
Springer
111views Algorithms» more  ESA 2005»
15 years 7 months ago
Delineating Boundaries for Imprecise Regions
In geographic information retrieval users use names of geographic regions that do not have a well-defined boundary, like Southern France. We present two approaches to compute rea...
Iris Reinbacher, Marc Benkert, Marc J. van Kreveld...
ANTS
2004
Springer
112views Algorithms» more  ANTS 2004»
15 years 7 months ago
Improved Weil and Tate Pairings for Elliptic and Hyperelliptic Curves
We present algorithms for computing the squared Weil and Tate pairings on an elliptic curve and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced i...
Kirsten Eisenträger, Kristin Lauter, Peter L....
IPPS
1998
IEEE
15 years 5 months ago
Caching-Efficient Multithreaded Fast Multiplication of Sparse Matrices
Several fast sequential algorithms have been proposed in the past to multiply sparse matrices. These algorithms do not explicitlyaddresstheimpactofcachingonperformance. We show th...
Peter Sulatycke, Kanad Ghose