Sciweavers

1272 search results - page 247 / 255
» Approximate Parameterized Matching
Sort
View
SIGMETRICS
2003
ACM
165views Hardware» more  SIGMETRICS 2003»
14 years 20 days ago
A hybrid systems modeling framework for fast and accurate simulation of data communication networks
In this paper we present a general hybrid systems modeling framework to describe the flow of traffic in communication networks. To characterize network behavior, these models use...
Stephan Bohacek, João P. Hespanha, Junsoo L...
CIKM
2003
Springer
14 years 19 days ago
Online duplicate document detection: signature reliability in a dynamic retrieval environment
As online document collections continue to expand, both on the Web and in proprietary environments, the need for duplicate detection becomes more critical. Few users wish to retri...
Jack G. Conrad, Xi S. Guo, Cindy P. Schriber
SIGECOM
2010
ACM
164views ECommerce» more  SIGECOM 2010»
14 years 7 days ago
Truthful mechanisms with implicit payment computation
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
Moshe Babaioff, Robert D. Kleinberg, Aleksandrs Sl...
WDAG
2009
Springer
94views Algorithms» more  WDAG 2009»
13 years 12 months ago
Local Computation of Nearly Additive Spanners
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
Bilel Derbel, Cyril Gavoille, David Peleg, Laurent...
STOC
2000
ACM
156views Algorithms» more  STOC 2000»
13 years 11 months ago
Near optimal multiple alignment within a band in polynomial time
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
Ming Li, Bin Ma, Lusheng Wang