Sciweavers

3818 search results - page 420 / 764
» Word Problems on Compressed Words
Sort
View
PKDD
2009
Springer
117views Data Mining» more  PKDD 2009»
16 years 1 months ago
New Regularized Algorithms for Transductive Learning
Abstract. We propose a new graph-based label propagation algorithm for transductive learning. Each example is associated with a vertex in an undirected graph and a weighted edge be...
Partha Pratim Talukdar, Koby Crammer
151
Voted
IH
2007
Springer
16 years 25 days ago
Three-Dimensional Meshes Watermarking: Review and Attack-Centric Investigation
The recent decade has seen the emergence of 3D meshes in industrial, medical and entertainment applications. Therefore, their intellectual property protection problem has attracted...
Kai Wang, Guillaume Lavoué, Florence Denis,...
TAMC
2007
Springer
16 years 24 days ago
On Deciding Deep Holes of Reed-Solomon Codes
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
Qi Cheng, Elizabeth Murray
IPPS
2005
IEEE
16 years 8 days ago
GUARD: Gossip Used for Autonomous Resource Detection
A growing trend in the development and deployment of grid computing systems is decentralization. Decentralizing these systems helps make them more scalable and robust, but poses s...
Sagnik Nandy, Larry Carter, Jeanne Ferrante
COCOON
2005
Springer
16 years 6 days ago
Exploring Simple Grid Polygons
Abstract. We investigate the online exploration problem of a shortsighted mobile robot moving in an unknown cellular room without obstacles. The robot has a very limited sensor; it...
Christian Icking, Thomas Kamphans, Rolf Klein, Elm...