Sciweavers

1840 search results - page 96 / 368
» time 2002
Sort
View
129
Voted
CCR
2002
155views more  CCR 2002»
15 years 3 months ago
A retrospective view of ATM
ATM was the focus of active research and significant investment in the early to mid 1990's. This paper discusses several visions for ATM prevalent at the time, and analyzes h...
Charles R. Kalmanek
COLING
2002
15 years 3 months ago
A Cheap and Fast Way to Build Useful Translation Lexicons
The paper presents a statistical approach to automatic building of translation lexicons from parallel corpora. We briefly describe the pre-processing steps, a baseline iterative m...
Dan Tufis
ET
2002
77views more  ET 2002»
15 years 3 months ago
Reusing Scan Chains for Test Pattern Decompression
The paper presents a method for testing a system-on-achip by using a compressed representation of the patterns on an external tester. The patterns for a certain core under test ar...
Rainer Dorsch, Hans-Joachim Wunderlich
115
Voted
IPL
2002
89views more  IPL 2002»
15 years 3 months ago
New bounds on the barycenter heuristic for bipartite graph drawing
The barycenter heuristic is often used to solve the NP-hard two-layer edge crossing minimization problem. It is well-known that the barycenter heuristic can give solutions as bad a...
Xiao Yu Li, Matthias F. M. Stallmann
128
Voted
JACM
2002
83views more  JACM 2002»
15 years 3 months ago
Fast context-free grammar parsing requires fast boolean matrix multiplication
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG par...
Lillian Lee