Sciweavers

236 search results - page 21 / 48
» Binary Partitions Revisited
Sort
View
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
15 years 15 days ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
ECCV
2008
Springer
16 years 2 months ago
Prior-Based Piecewise-Smooth Segmentation by Template Competitive Deformation Using Partitions of Unity
We propose a new algorithm for two-phase, piecewise-smooth segmentation with shape prior. The image is segmented by a binary template that is deformed by a regular geometric transf...
Benoit Mory, Laurent D. Cohen, Oudom Somphone, Sh&...
WEBI
2005
Springer
15 years 6 months ago
Privacy-Preserving Top-N Recommendation on Horizontally Partitioned Data
Collaborative filtering techniques are widely used by many E-commerce sites for recommendation purposes. Such techniques help customers by suggesting products to purchase using o...
Huseyin Polat, Wenliang Du
127
Voted
PAMI
2011
14 years 7 months ago
Applying Property Testing to an Image Partitioning Problem
—Property testing is a rapidly growing field of research. Typically, a property testing algorithm proceeds by quickly determining whether an input can satisfy some condition, und...
Igor Kleiner, Daniel Keren, Ilan Newman, Oren Ben-...
116
Voted
MP
2002
143views more  MP 2002»
15 years 10 days ago
Extending Dantzig's bound to the bounded multiple-class binary Knapsack problem
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...
François Vanderbeck