5316 search results - page 233 / 1064 » Which Search Problems Are Random |
189
Voted
KDD
2008
ACM
16 years 5 months ago
2008
ACM
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
165
Voted
CONSTRAINTS
2010
15 years 4 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
121
click to vote
ICIP
2004
IEEE
16 years 6 months ago
2004
IEEE
Image-based rendering data sets, such as light fields, require efficient compression due to their large data size, but also easy random access when rendering from the data set. Ef...
188
Voted
CONSTRAINTS
1998
15 years 4 months ago
1998
Many temporal applications like planning and scheduling can be viewed as special cases of the numeric and symbolic temporal constraint satisfaction problem. Thus we have developed ...
162
click to vote
BMCBI
2005
15 years 4 months ago
2005
Background: High throughput microarray analyses result in many differentially expressed genes that are potentially responsible for the biological process of interest. In order to ...