Sciweavers

6142 search results - page 139 / 1229
» The Complexity of Partition Functions
Sort
View
DAM
2006
113views more  DAM 2006»
14 years 10 months ago
On the complexity of suboptimal decoding for list and decision feedback schemes
We consider bounded distance list decoding, such that the decoder calculates the list of all codewords within a sphere around the received vector. We analyze the performance and t...
Jürgen Freudenberger, Victor V. Zyablov
HAPTICS
2005
IEEE
15 years 3 months ago
Dynamic Primitive Caching for Haptic Rendering of Large-Scale Models
In this paper we present a software approach to managing complexity for haptic rendering of large-scale geometric models, consisting of tens to hundreds of thousands of distinct g...
Mashhuda Glencross, Roger J. Hubbold, Ben Lyons
ICDT
1997
ACM
133views Database» more  ICDT 1997»
15 years 2 months ago
A Formal Foundation for Distributed Workflow Execution Based on State Charts
This paper provides a formal foundation for distributed workfiow executions. The state chart formalism is adapted to the needs of a workflow model in order to establish a basis for...
Dirk Wodtke, Gerhard Weikum
COR
2008
102views more  COR 2008»
14 years 9 months ago
An algorithm for ranking assignments using reoptimization
We consider the problem of ranking assignments according to cost in the classical linear assignment problem. An algorithm partitioning the set of possible assignments, as suggeste...
Christian Roed Pedersen, Lars Relund Nielsen, Kim ...
WIOPT
2010
IEEE
14 years 8 months ago
Static community detection algorithms for evolving networks
—Complex networks can often be divided in dense sub-networks called communities. Using a partition edit distance, we study how three community detection algorithms transform thei...
Thomas Aynaud, Jean-Loup Guillaume