Sciweavers

746 search results - page 58 / 150
» Fast (Structured) Newton Computations
Sort
View
COLING
2002
13 years 10 months ago
Integrating Linguistic and Performance-Based Constraints for Assigning Phrase Breaks
The mapping between syntactic structure and prosodic structure is a widely discussed topic in linguistics. In this work we use insights gained from research on syntax-to-prosody m...
Michaela Atterer, Ewan Klein
SMA
2009
ACM
185views Solid Modeling» more  SMA 2009»
14 years 4 months ago
A dynamic data structure for flexible molecular maintenance and informatics
We present the “Dynamic Packing Grid” (DPG) data structure along with details of our implementation and performance results, for maintaining and manipulating flexible molecul...
Chandrajit L. Bajaj, Rezaul Alam Chowdhury, Muhibu...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
14 years 2 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
CIVR
2009
Springer
212views Image Analysis» more  CIVR 2009»
14 years 4 months ago
Video copy detection by fast sequence matching
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
Mei-Chen Yeh, Kwang-Ting Cheng
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
13 years 1 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...