Sciweavers

5153 search results - page 699 / 1031
» Introduction to Randomized Algorithms
Sort
View
IMAMS
2003
212views Mathematics» more  IMAMS 2003»
15 years 5 months ago
Watermarking 3D Polygonal Meshes Using the Singular Spectrum Analysis
Watermarking is to embed a structure called a watermark into the target data such as images. The watermark can be used, for example, in order to secure the copyright and detect tam...
Kohei Muratani, Kokichi Sugihara
SDM
2003
SIAM
174views Data Mining» more  SDM 2003»
15 years 5 months ago
STAMP: On Discovery of Statistically Important Pattern Repeats in Long Sequential Data
In this paper, we focus on mining periodic patterns allowing some degree of imperfection in the form of random replacement from a perfect periodic pattern. In InfoMiner+, we propo...
Jiong Yang, Wei Wang 0010, Philip S. Yu
FLAIRS
1998
15 years 5 months ago
Lazy Transformation-Based Learning
Weintroduce a significant improvementfor a relatively newmachine learning methodcalled Transformation-Based Learning. By applying a MonteCarlo strategy to randomly sample from the...
Ken Samuel
VCIP
2000
180views Communications» more  VCIP 2000»
15 years 5 months ago
Compression and rendering of concentric mosaics with reference block codec (RBC)
Concentric mosaics have the ability to quickly capture a complete 3D view of a realistic environment and to enable a user to wander freely in the environment. However, the data am...
Cha Zhang, Jin Li
AAAI
1996
15 years 5 months ago
Forward Estimation for Game-Tree Search
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
Weixiong Zhang