Sciweavers

1603 search results - page 207 / 321
» Universal Confidence Sets for Solutions of Optimization Prob...
Sort
View
PODS
2003
ACM
113views Database» more  PODS 2003»
16 years 6 months ago
Materializing views with minimal size to answer queries
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
Rada Chirkova, Chen Li
NIPS
2007
15 years 7 months ago
The discriminant center-surround hypothesis for bottom-up saliency
The classical hypothesis, that bottom-up saliency is a center-surround process, is combined with a more recent hypothesis that all saliency decisions are optimal in a decision-the...
Dashan Gao, Vijay Mahadevan, Nuno Vasconcelos
INFOCOM
2008
IEEE
16 years 26 days ago
On Maximizing the Lifetime of Delay-Sensitive Wireless Sensor Networks with Anycast
—Sleep-wake scheduling is an effective mechanism to prolong the lifetime of energy-constrained wireless sensor networks. However, it incurs an additional delay for packet deliver...
Joohwan Kim, Xiaojun Lin, Ness B. Shroff, Prasun S...
EPIA
2007
Springer
16 years 19 days ago
Improving Evolutionary Algorithms with Scouting
The goal of an Evolutionary Algorithm(EA) is to find the optimal solution to a given problem by evolving a set of initial potential solutions. When the problem is multi-modal, an ...
Konstantinos Bousmalis, Gillian M. Hayes, Jeffrey ...
ITCC
2000
IEEE
15 years 11 months ago
Parallel Real-Time Numerical Computation: Beyond Speedup III
Parallel computers can do more than simply speed up sequential computations. They are capable of nding solutions that are far better in quality than those obtained by sequential c...
Selim G. Akl, Stefan D. Bruda