5316 search results - page 232 / 1064 » Which Search Problems Are Random |
148
Voted
BNCOD
2004
15 years 6 months ago
2004
Abstract. We present a new application for keyword search within relational databases, which uses a novel algorithm to solve the join discovery problem by finding Memex-like trails...
135
click to vote
MP
2002
15 years 4 months ago
2002
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
170
click to vote
DAGSTUHL
2007
15 years 6 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...
138
Voted
CVPR
2010
IEEE
15 years 3 months ago
2010
IEEE
In this work, we investigate how to propagate annotated labels for a given single image from the image-level to their corresponding semantic regions, namely Label-toRegion (L2R), ...
159
Voted
TSMC
2011
14 years 11 months ago
2011
—The university course timetabling problem (UCTP) is a combinatorial optimization problem, in which a set of events has to be scheduled into time slots and located into suitable ...