Sciweavers

4604 search results - page 725 / 921
» Analysis of Negotiation Dynamics
Sort
View
DCC
2005
IEEE
16 years 6 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
CVPR
2009
IEEE
16 years 4 months ago
A projector-camera setup for geometry-invariant frequency demultiplexing
Consider a projector-camera setup where a sinusoidal pattern is projected onto the scene, and an image of the objects imprinted with the pattern is captured by the camera. In this...
Daniel A. Vaquero, Matthew Turk, Ramesh Raskar, Ro...
SODA
2010
ACM
205views Algorithms» more  SODA 2010»
16 years 3 months ago
Maximum Flows and Parametric Shortest Paths in Planar Graphs
We observe that the classical maximum flow problem in any directed planar graph G can be reformulated as a parametric shortest path problem in the oriented dual graph G . This ref...
Jeff Erickson
ICWS
2009
IEEE
16 years 3 months ago
An Approach to Incentive-Based Reputation for Communities of Web Services
—Community of web services (CWS) is a society composed by a number of functionally identical web services. The communities always aim to increase their reputation level in order ...
Babak Khosravifar, Jamal Bentahar, Philippe Thiran...
EUROSYS
2009
ACM
16 years 3 months ago
Predicting replicated database scalability from standalone database profiling
This paper develops analytical models to predict the throughput and the response time of a replicated database using measurements of the workload on a standalone database. These m...
Sameh Elnikety, Steven G. Dropsho, Emmanuel Cecche...