Sciweavers

1275 search results - page 29 / 255
» time 1998
Sort
View
KDD
1998
ACM
190views Data Mining» more  KDD 1998»
14 years 2 months ago
Mining Segment-Wise Periodic Patterns in Time-Related Databases
Periodicity search, that is, searchfor cyclicity in time-related databases, is an interesting data mining problem. Mostprevious studies have been on finding full-cycle periodicity...
Jiawei Han, Wan Gong, Yiwen Yin
WSC
1998
13 years 11 months ago
Application of Real-Time Simulation to Assign Due Dates on Logistic-manufacturing Networks
This paper presents the application of real-time simulation to assign due dates on logistic-manufacturing networks. Information from the manufacturing, transportation, and supplie...
Alex J. Ruiz-Torres, Kazuo Nakatani
PAMI
1998
193views more  PAMI 1998»
13 years 10 months ago
Real-Time American Sign Language Recognition Using Desk and Wearable Computer Based Video
—We present two real-time hidden Markov model-based systems for recognizing sentence-level continuous American Sign Language (ASL) using a single camera to track the user’s una...
Thad Starner, Joshua Weaver, Alex Pentland
SIGACT
1998
105views more  SIGACT 1998»
13 years 10 months ago
Everything you wanted to know about the running time of Mergesort but were afraid to ask
Although mergesort is an algorithm that is frequently glossed over in textbooks, it provides fertile ground for planting ideas about algorithm analysis in the minds of students. A...
Ian Parberry
ORL
1998
97views more  ORL 1998»
13 years 10 months ago
The complexity of cover inequality separation
Crowder et al. (Oper. Res. 31 (1983) 803–834) conjectured that the separation problem for cover inequalities for binary integer programs is polynomially solvable. We show that t...
Diego Klabjan, George L. Nemhauser, Craig A. Tovey