Sciweavers

135 search results - page 25 / 27
» Competitive Searching in a Generalized Street
Sort
View
ISCI
2007
141views more  ISCI 2007»
13 years 7 months ago
A performance comparison of distance-based query algorithms using R-trees in spatial databases
Efficient processing of distance-based queries (DBQs) is of great importance in spatial databases due to the wide area of applications that may address such queries. The most repr...
Antonio Corral, Jesús Manuel Almendros-Jim&...
ATAL
2004
Springer
14 years 1 months ago
Multi-Agent Service Description/Discovery Games
Agent description and discovery (ADD) is a critical infrastructure for open multi-agent services. As multi-agent systems grow larger and more diverse, it becomes harder to locate ...
Jun Wang, Les Gasser
CPM
1998
Springer
209views Combinatorics» more  CPM 1998»
13 years 12 months ago
A Fast Bit-Vector Algorithm for Approximate String Matching Based on Dynamic Programming
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
Gene Myers
APPROX
2005
Springer
103views Algorithms» more  APPROX 2005»
14 years 1 months ago
Where's the Winner? Max-Finding and Sorting with Metric Costs
Traditionally, a fundamental assumption in evaluating the performance of algorithms for sorting and selection has been that comparing any two elements costs one unit (of time, work...
Anupam Gupta, Amit Kumar
CIKM
2004
Springer
14 years 1 months ago
Hierarchical document categorization with support vector machines
Automatically categorizing documents into pre-defined topic hierarchies or taxonomies is a crucial step in knowledge and content management. Standard machine learning techniques ...
Lijuan Cai, Thomas Hofmann