Sciweavers

2853 search results - page 305 / 571
» Finding related tables
Sort
View
SCCC
1998
IEEE
15 years 10 months ago
Dynamic Programming as Frame for Efficient Parsing
The last few years have seen a renewal of interest in the consideration of dynamic programming in compiler technology. This is due to the compactness of the representations, which...
Manuel Vilares Ferro, Miguel A. Alonso, David Cabr...
WETICE
1998
IEEE
15 years 10 months ago
An Open Architecture for Supporting Collaboration on the Web
The MEMOIR framework supports researchers working with a vast quantity of distributed information, by assisting them in finding both relevant documents and researchers with relate...
David De Roure, Wendy Hall, Siegfried Reich, Aggel...
160
Voted
CIAC
1997
Springer
111views Algorithms» more  CIAC 1997»
15 years 10 months ago
A Meticulous Analysis of Mergesort Programs
The efficiency of mergesortprogramsis analysed under a simple unit-cost model. In our analysis the time performance of the sorting programs includes the costs of key comparisons, e...
Jyrki Katajainen, Jesper Larsson Träff
ISN
1997
Springer
15 years 10 months ago
End User Acceptance of Security Technology for Electronic Commerce
This paper examines the current advantages and limitations of the developing Global Information Infrastructure (GII) for commerce from the point of view of today’s players. It i...
Dale Whinnett
STOC
1994
ACM
125views Algorithms» more  STOC 1994»
15 years 10 months ago
A spectral technique for coloring random 3-colorable graphs (preliminary version)
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
Noga Alon, Nabil Kahale