Sciweavers

477 search results - page 81 / 96
» Algorithms for dynamic geometric problems over data streams
Sort
View
ICDAR
2007
IEEE
14 years 2 months ago
Handwritten Word Recognition Using Conditional Random Fields
The paper describes a lexicon driven approach for word recognition on handwritten documents using Conditional Random Fields(CRFs). CRFs are discriminative models and do not make a...
Shravya Shetty, Harish Srinivasan, Sargur N. Sriha...
IPPS
2009
IEEE
14 years 3 months ago
A metascalable computing framework for large spatiotemporal-scale atomistic simulations
A metascalable (or “design once, scale on new architectures”) parallel computing framework has been developed for large spatiotemporal-scale atomistic simulations of materials...
Ken-ichi Nomura, Richard Seymour, Weiqiang Wang, H...
ICDE
2004
IEEE
128views Database» more  ICDE 2004»
14 years 9 months ago
Detection and Correction of Conflicting Source Updates for View Maintenance
Data integration over multiple heterogeneous data sources has become increasingly important for modern applications. The integrated data is usually stored in materialized views fo...
Songting Chen, Jun Chen, Xin Zhang, Elke A. Runden...
EDBT
2006
ACM
191views Database» more  EDBT 2006»
14 years 8 months ago
Parallelizing Skyline Queries for Scalable Distribution
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. Current skyline computation methods are rest...
Ping Wu, Caijie Zhang, Ying Feng, Ben Y. Zhao, Div...
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 1 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun