663 search results - page 76 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
Continuous top-k queries, which report a certain number (k) of top preferred objects from data streams, are important for a broad class of real-time applications, ranging from fi...
QSHINE
2009
IEEE
2009
IEEE
Joint Optimization of System Lifetime and Network Performance for Real-Time Wireless Sensor Networks
14 years 2 months ago
Maximizing the aggregate network utility and minimizing the network energy consumption are important but conflict goals in wireless sensor networks. Challenges arise due to the app...
ISVC
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper addresses the estimation of camera motion and 3D reconstruction from image sequences for multiple independently moving cameras. If multiple moving cameras reco...
FOCS
2000
IEEE
13 years 11 months ago
2000
IEEE
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
PR
2007
13 years 7 months ago
2007
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...