Sciweavers

5210 search results - page 687 / 1042
» Exact geometric computation
Sort
View
NLP
2000
15 years 7 months ago
Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
Jean-Cédric Chappelier, Martin Rajman
VLDB
2000
ACM
129views Database» more  VLDB 2000»
15 years 7 months ago
Offering a Precision-Performance Tradeoff for Aggregation Queries over Replicated Data
Strict consistency of replicated data is infeasible or not required by many distributed applications, so current systems often permit stale replication, in which cached copies of ...
Chris Olston, Jennifer Widom
ALGORITHMICA
2010
154views more  ALGORITHMICA 2010»
15 years 4 months ago
On the Convergence of Multicast Games in Directed Networks
We investigate the convergence of the price of anarchy after a limited number of moves in the classical multicast communication game when the underlying communication networks is ...
Angelo Fanelli, Michele Flammini, Luca Moscardelli
ALGORITHMICA
2010
106views more  ALGORITHMICA 2010»
15 years 4 months ago
Analysis of the Expected Number of Bit Comparisons Required by Quickselect
When algorithms for sorting and searching are applied to keys that are represented as bit strings, we can quantify the performance of the algorithms not only in terms of the numbe...
James Allen Fill, Takéhiko Nakama
BMCBI
2008
138views more  BMCBI 2008»
15 years 4 months ago
Information transfer in signaling pathways: A study using coupled simulated and experimental data
Background: The topology of signaling cascades has been studied in quite some detail. However, how information is processed exactly is still relatively unknown. Since quite divers...
Jürgen Pahle, Anne K. Green, C. Jane Dixon, U...