329 search results - page 38 / 66 » On Range Searching with Semialgebraic Sets |
CP
2009
Springer
14 years 3 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
DEXA
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such t...
ICDM
2002
IEEE
14 years 1 months ago
2002
IEEE
The similarity join has become an important database primitive to support similarity search and data mining. A similarity join combines two sets of complex objects such that the r...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
JUCS
2007
13 years 8 months ago
2007
Abstract: Knowledge management is characterized by many different activities ranging from the elicitation of knowledge to its storing, sharing, maintenance, usage and creation. Sk...