3223 search results - page 284 / 645 » The Scaling of Search Cost |
194
click to vote
WSC
2000
15 years 8 months ago
2000
Computation of power control calculations is one of the most time-consuming aspects of simulating wireless communication systems. These calculations are critical to understanding ...
167
click to vote
SODA
1993
ACM
15 years 8 months ago
1993
ACM
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
178
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
198
click to vote
TSE
2010
15 years 1 months ago
2010
Search-based software engineering is an emerging paradigm that uses automated search algorithms to help designers iteratively find solutions to complicated design problems. For exa...
203
click to vote
CVPR
2011
IEEE
14 years 10 months ago
2011
IEEE
Is the real problem in finding the relative orientation of two viewpoints the correspondence problem? We argue that this is only one difficulty. Even with known correspondences,...