Sciweavers

5316 search results - page 320 / 1064
» Which Search Problems Are Random
Sort
View
FLAIRS
2006
15 years 8 months ago
Using Web Searches on Important Words to Create Background Sets for LSI Classification
The world wide web has a wealth of information that is related to almost any text classification task. This paper presents a method for mining the web to improve text classificati...
Sarah Zelikovitz, Marina Kogan
ICIS
2000
15 years 8 months ago
Personalization of search engine services for effective retrieval and knowledge management
The Internet and corporate intranets provide far more information than anybody can absorb. People use search engines to find the information they require. However, these systems t...
Weiguo Fan, Michael D. Gordon, Praveen Pathak
SIAMJO
2002
149views more  SIAMJO 2002»
15 years 6 months ago
Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
Motivated by some results for linear programs and complementarity problems, this paper gives some new characterizations of the central path conditions for semidefinite programs. Ex...
Christian Kanzow, Christian Nagel
TODS
2002
92views more  TODS 2002»
15 years 6 months ago
Searching in metric spaces with user-defined and approximate distances
Metric access methods (MAMs), such as the M-tree, are powerful index structures for supporting ty queries on metric spaces, which represent a common abstraction for those searchin...
Paolo Ciaccia, Marco Patella
GFKL
2005
Springer
142views Data Mining» more  GFKL 2005»
16 years 16 days ago
Near Similarity Search and Plagiarism Analysis
Abstract. Existing methods to text plagiarism analysis mainly base on “chunking”, a process of grouping a text into meaningful units each of which gets encoded by an integer nu...
Benno Stein, Sven Meyer zu Eissen