Sciweavers

2715 search results - page 455 / 543
» Total Generalized Variation
Sort
View
113
Voted
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
15 years 6 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
118
Voted
CCS
2004
ACM
15 years 6 months ago
Private inference control
Access control can be used to ensure that database queries pertaining to sensitive information are not answered. This is not enough to prevent users from learning sensitive inform...
David P. Woodruff, Jessica Staddon
81
Voted
CPM
2004
Springer
110views Combinatorics» more  CPM 2004»
15 years 6 months ago
On the k-Closest Substring and k-Consensus Pattern Problems
Given a set S = {s1, s2, . . . , sn} of strings each of length m, and an integer L, we study the following two problems. k-Closest Substring problem: find k center strings c1, c2,...
Yishan Jiao, Jingyi Xu, Ming Li
EMSOFT
2004
Springer
15 years 6 months ago
Binary translation to improve energy efficiency through post-pass register re-allocation
Energy efficiency is rapidly becoming a first class optimization parameter for modern systems. Caches are critical to the overall performance and thus, modern processors (both hig...
Kun Zhang, Tao Zhang, Santosh Pande
110
Voted
ICALP
2004
Springer
15 years 6 months ago
Online Scheduling with Bounded Migration
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
Peter Sanders, Naveen Sivadasan, Martin Skutella