Sciweavers

2056 search results - page 154 / 412
» time 2000
Sort
View
IJNM
2000
91views more  IJNM 2000»
15 years 4 months ago
Coding-based schemes for fault identification in communication networks
The complexity of communication networks and the amount of information transferred in these networks have made the management of such networks increasingly difficult. Since faults ...
Chi-Chun Lo, Shing Hong Chen, Bon-Yeh Lin
DCG
2000
104views more  DCG 2000»
15 years 4 months ago
Efficient Algorithms for Approximating Polygonal Chains
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
Pankaj K. Agarwal, Kasturi R. Varadarajan
SAC
2000
ACM
15 years 9 months ago
The Evolution of the DARWIN System
DARWIN is a web-based system for presenting the results of wind-tunnel testing and computational model analyses to aerospace designers. DARWIN captures the data, maintains the inf...
Joan D. Walton, Robert E. Filman, David J. Korsmey...
137
Voted
ERCIMDL
2008
Springer
107views Education» more  ERCIMDL 2008»
15 years 6 months ago
Revisiting Lexical Signatures to (Re-)Discover Web Pages
A lexical signature (LS) is a small set of terms derived from a document that capture the "aboutness" of that document. A LS generated from a web page can be used to disc...
Martin Klein, Michael L. Nelson
IJCAI
2003
15 years 6 months ago
Amalgams of Constraint Satisfaction Problems
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
Andrei A. Bulatov, Evgeny S. Skvortsov