Sciweavers

2252 search results - page 410 / 451
» Improving Random Forests
Sort
View
ICDAR
2009
IEEE
16 years 22 days ago
Text Lines and Snippets Extraction for 19th Century Handwriting Documents Layout Analysis
In this paper we propose a new approach to improve electronic editions of human science corpus, providing an efficient estimation of manuscripts pages structure. In any handwriti...
Vincent Malleron, Véronique Eglin, Hubert E...
ICNP
2009
IEEE
16 years 19 days ago
ESC: Energy Synchronized Communication in Sustainable Sensor Networks
—With advances in energy harvesting techniques, it is now feasible to build sustainable sensor networks (SSN) to support long-term applications. Unlike battery-powered sensor net...
Yu Gu, Ting Zhu, Tian He
ACML
2009
Springer
16 years 18 days ago
Context-Aware Online Commercial Intention Detection
With more and more commercial activities moving onto the Internet, people tend to purchase what they need through Internet or conduct some online research before the actual transac...
Derek Hao Hu, Dou Shen, Jian-Tao Sun, Qiang Yang, ...
APPROX
2009
Springer
112views Algorithms» more  APPROX 2009»
16 years 17 days ago
Deterministic Approximation Algorithms for the Nearest Codeword Problem
The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v ∈ Fn 2 and a linear space L ⊆ Fn 2 of dimension k NC...
Noga Alon, Rina Panigrahy, Sergey Yekhanin
ASIACRYPT
2009
Springer
16 years 17 days ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...