Sciweavers

4850 search results - page 240 / 970
» Approximate Data Structures with Applications
Sort
View
DEXA
2006
Springer
193views Database» more  DEXA 2006»
15 years 10 months ago
Understanding and Enhancing the Folding-In Method in Latent Semantic Indexing
Abstract. Latent Semantic Indexing(LSI) has been proved to be effective to capture the semantic structure of document collections. It is widely used in content-based text retrieval...
Xiang Wang 0002, Xiaoming Jin
LREC
2010
152views Education» more  LREC 2010»
15 years 8 months ago
Grammar Extraction from Treebanks for Hindi and Telugu
Grammars play an important role in many Natural Language Processing (NLP) applications. The traditional approach to creating grammars manually, besides being labor-intensive, has ...
Prasanth Kolachina, Sudheer Kolachina, Anil Kumar ...
NIPS
2008
15 years 8 months ago
Online Metric Learning and Fast Similarity Search
Metric learning algorithms can provide useful distance functions for a variety of domains, and recent work has shown good accuracy for problems where the learner can access all di...
Prateek Jain, Brian Kulis, Inderjit S. Dhillon, Kr...
COMCOM
2010
276views more  COMCOM 2010»
15 years 6 months ago
Adjustable convergecast tree protocol for wireless sensor networks
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
Tzung-Shi Chen, Hua-Wen Tsai, Chih-Ping Chu
CVIU
2008
180views more  CVIU 2008»
15 years 6 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...