2403 search results - page 263 / 481 » Optimal Randomized RANSAC |
143
click to vote
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Algorithms dealing with massive data sets are usually designed for I/O-efficiency, often captured by the I/O model by Aggarwal and Vitter. Another aspect of dealing with ...
138
Voted
SAGA
2009
Springer
15 years 10 months ago
2009
Springer
In the economical caching problem, an online algorithm is given a sequence of prices for a certain commodity. The algorithm has to manage a buffer of fixed capacity over time. We...
140
Voted
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—In the routing and cost sharing of multicast towards a group of potential receivers, cross-monotonicity is a property that states a user’s payment can only be smaller when ser...
148
click to vote
ISVLSI
2008
IEEE
15 years 10 months ago
2008
IEEE
In high-performance VLSI circuits, the on-chip power densities are playing dominant role due to increased scaling of technology, increasing number of components, frequency and ban...
136
Voted
SECON
2008
IEEE
15 years 10 months ago
2008
IEEE
—The novel cross-layer protocol Breath for wireless sensor networks is designed, implemented, and experimentally evaluated. The Breath protocol is based on randomized routing, MA...