868 search results - page 116 / 174 » Finding Most Likely Solutions |
STOC
2003
ACM
14 years 10 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
SIGMOD
2006
ACM
14 years 10 months ago
2006
ACM
We study the problem of finding efficient equivalent viewbased rewritings of relational queries, focusing on query optimization using materialized views under the assumption that ...
CIVR
2008
Springer
13 years 12 months ago
2008
Springer
Great effort has been made to improve video concept detection and continuous progress has been reported. With the current evaluation method being confined to carefully annotated d...
CCR
2002
13 years 10 months ago
2002
Most network protocols are uni-modal: they employ a single set of algorithms that allows them to cope well only within a narrow range of operating conditions. This rigid design re...
AINTEC
2007
Springer
14 years 4 months ago
2007
Springer
With the tremendous growth of World Wide Web (WWW), the door has been opened to a multitude of services and information for even the most casual of users. Today, many wireless and ...