Sciweavers

SIVP
2008
92views more  SIVP 2008»
13 years 9 months ago
Reduced decoder complexity and latency in pixel-domain Wyner-Ziv video coders
In some video coding applications, it is desirable to reduce the complexity of the video encoder at the expense of a more complex decoder. Wyner
Marleen Morbée, Antoni Roca, Josep Prades-N...
AI
2005
Springer
13 years 9 months ago
Unifying tree decompositions for reasoning in graphical models
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction ...
Kalev Kask, Rina Dechter, Javier Larrosa, Avi Dech...
AEI
2005
99views more  AEI 2005»
13 years 9 months ago
Comparison among five evolutionary-based optimization algorithms
Evolutionary algorithms (EAs) are stochastic search methods that mimic the natural biological evolution and/or the social behavior of species. Such algorithms have been developed ...
Emad Elbeltagi, Tarek Hegazy, Donald E. Grierson
SIGPRO
2008
130views more  SIGPRO 2008»
13 years 9 months ago
A fast algorithm for the computation of 2-D forward and inverse MDCT
A fast algorithm for computing the two-dimensional (2-D) forward and inverse modified discrete cosine transform (MDCT and IMDCT) is proposed. The algorithm converts the 2-D MDCT an...
J. S. Wu, Huazhong Shu, Lotfi Senhadji, Limin Luo
IJIS
2007
155views more  IJIS 2007»
13 years 9 months ago
Clustering web search results using fuzzy ants
Algorithms for clustering web search results have to be efficient and robust. Furthermore they must be able to cluster a dataset without using any kind of a priori information, s...
Steven Schockaert, Martine De Cock, Chris Cornelis...
IJFCS
2007
80views more  IJFCS 2007»
13 years 9 months ago
Bisimulation Minimization of Tree Automata
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...
Parosh Aziz Abdulla, Johanna Högberg, Lisa Ka...
SIGMOD
2008
ACM
124views Database» more  SIGMOD 2008»
13 years 9 months ago
Scalable network distance browsing in spatial databases
An algorithm is presented for finding the k nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shorte...
Hanan Samet, Jagan Sankaranarayanan, Houman Alborz...
IJDMB
2007
114views more  IJDMB 2007»
13 years 9 months ago
A parallel edge-betweenness clustering tool for Protein-Protein Interaction networks
: The increasing availability of protein-protein interaction graphs (PPI) requires new efficient tools capable of extracting valuable biological knowledge from these networks. Amon...
Qiaofeng Yang, Stefano Lonardi
SIGMETRICS
2008
ACM
138views Hardware» more  SIGMETRICS 2008»
13 years 9 months ago
Utility maximization in peer-to-peer systems
In this paper, we study the problem of utility maximization in P2P systems, in which aggregate application-specific utilities are maximized by running distributed algorithms on P2...
Minghua Chen, Miroslav Ponec, Sudipta Sengupta, Ji...
SAC
2006
ACM
13 years 9 months ago
Generating correct EPCs from configured C-EPCs
Process reference models play an important role for the alignment and configuration of commercial off-the-shelf Enterprise Systems to requirements of an organization. Recently, Co...
Jan Mendling, Jan Recker, Michael Rosemann, Wil M....