Sciweavers

501 search results - page 86 / 101
» Rough Sets and Approximation Schemes
Sort
View
145
Voted
IMC
2005
ACM
15 years 11 months ago
Improving Sketch Reconstruction Accuracy Using Linear Least Squares Method
Sketch is a sublinear space data structure that allows one to approximately reconstruct the value associated with any given key in an input data stream. It is the basis for answer...
Gene Moo Lee, Huiya Liu, Young Yoon, Yin Zhang
164
Voted
SMA
2005
ACM
201views Solid Modeling» more  SMA 2005»
15 years 11 months ago
Fast and robust detection of crest lines on meshes
We propose a fast and robust method for detecting crest lines on surfaces approximated by dense triangle meshes. The crest lines, salient surface features defined via first- and...
Shin Yoshizawa, Alexander G. Belyaev, Hans-Peter S...
FOCS
2002
IEEE
15 years 10 months ago
Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows
We consider the problem of sampling almost uniformly from the set of contingency tables with given row and column sums, when the number of rows is a constant. Cryan and Dyer [3] h...
Mary Cryan, Martin E. Dyer, Leslie Ann Goldberg, M...
RTSS
2002
IEEE
15 years 10 months ago
Maximizing the System Value while Satisfying Time and Energy Constraints
Typical real-time scheduling theory has addressed deadline and energy constraints as well as deadline and reward constraints simultaneously in the past. However, we believe that e...
Cosmin Rusu, Rami G. Melhem, Daniel Mossé
ESA
2009
Springer
167views Algorithms» more  ESA 2009»
15 years 10 months ago
Clustering-Based Bidding Languages for Sponsored Search
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...
Mohammad Mahdian, Grant Wang