Sciweavers

7930 search results - page 1281 / 1586
» Greedy in Approximation Algorithms
Sort
View
WAIM
2007
Springer
16 years 1 months ago
Building Data Synopses Within a Known Maximum Error Bound
The constructions of Haar wavelet synopses for large data sets have proven to be useful tools for data approximation. Recently, research on constructing wavelet synopses with a gua...
Chaoyi Pang, Qing Zhang, David P. Hansen, Anthony ...
WINE
2007
Springer
124views Economy» more  WINE 2007»
16 years 1 months ago
Stochastic Models for Budget Optimization in Search-Based Advertising
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...
S. Muthukrishnan, Martin Pál, Zoya Svitkina
CRV
2006
IEEE
69views Robotics» more  CRV 2006»
16 years 1 months ago
Photometric Stereo with Nearby Planar Distributed Illuminants
This paper considers the problem of shape-from-shading using nearby planar distributed illuminants. It is shown that a rectangular planar nearby distributed uniform isotropic illu...
James J. Clark
DATE
2006
IEEE
114views Hardware» more  DATE 2006»
16 years 1 months ago
A built-in redundancy-analysis scheme for RAMs with 2D redundancy using 1D local bitmap
Built-in self-repair (BISR) technique is gaining popular for repairing embedded memory cores in system-onchips (SOCs). To increase the utilization of memory redundancy, the BISR t...
Tsu-Wei Tseng, Jin-Fu Li, Da-Ming Chang
FOCS
2006
IEEE
16 years 1 months ago
Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
Krzysztof Onak, Pawel Parys
« Prev « First page 1281 / 1586 Last » Next »