Sciweavers

2124 search results - page 200 / 425
» Aggregating time partitions
Sort
View
FOCS
2007
IEEE
15 years 10 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
PODC
2004
ACM
15 years 9 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
VRML
1998
ACM
15 years 8 months ago
Simplicial Maps for Progressive Transmission of Polygonal Surfaces
We present a new method for (1) automatically generating multiple Levels Of Detail (LODs) of a polygonal surface, (2) progressively loading, or transmitting, and displaying a surf...
André Guéziec, Gabriel Taubin, Franc...
ALMOB
2006
89views more  ALMOB 2006»
15 years 4 months ago
On the maximal cliques in c-max-tolerance graphs and their application in clustering molecular sequences
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
Katharina Anna Lehmann, Michael Kaufmann, Stephan ...
IPL
2002
79views more  IPL 2002»
15 years 4 months ago
A self-adjusting quality of service control scheme
We propose and analyze a self-adjusting Quality of Service (QoS) control scheme with the goal of optimizing the system reward as a result of servicing different priority clients w...
Sheng-Tzong Cheng, Ing-Ray Chen