5316 search results - page 297 / 1064 » Which Search Problems Are Random |
191
Voted
EDBTW
2004
Springer
15 years 11 months ago
2004
Springer
Many users and applications require the integration of semi-structured data from autonomous, heterogeneous Web sources. Over the last years mediator systems have emerged that use d...
140
click to vote
JMLR
2006
15 years 6 months ago
2006
We show how the concave-convex procedure can be applied to transductive SVMs, which traditionally require solving a combinatorial search problem. This provides for the first time ...
181
Voted
SIBGRAPI
2008
IEEE
16 years 14 days ago
2008
IEEE
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in Rd into a data structure, so that it is possible to det...
200
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
205
click to vote
HIS
2009
15 years 3 months ago
2009
Scheduling is a key problem in distributed heterogeneous computing systems in order to benefit from the large computing capacity of such systems and is an NP-complete problem. In ...