2168 search results - page 112 / 434 » Randomized Algorithms and Complexity Theory |
116
click to vote
COMPGEOM
1997
ACM
15 years 7 months ago
1997
ACM
Given a pair of nonidentical complex objects, de ning and determining how similar they are to each other is a nontrivial problem. In data mining applications, one frequently nee...
186
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
Software testing is an expensive process, which is vital in the industry. Construction of the test-data in software testing requires the major cost and to decide which method to us...
138
Voted
CIKM
2008
Springer
15 years 5 months ago
2008
Springer
We address the problem of academic conference homepage understanding for the Semantic Web. This problem consists of three labeling tasks - labeling conference function pages, func...
149
click to vote
EGPGV
2004
Springer
15 years 8 months ago
2004
Springer
This paper investigates assignment strategies (load balancing algorithms) for process farms which solve the problem of online placement of a constant number of independent tasks w...
102
click to vote
JAIR
2007
15 years 3 months ago
2007
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show tha...