Sciweavers

514 search results - page 6 / 103
» Packet Classification Algorithms: From Theory to Practice
Sort
View
IJCV
2007
159views more  IJCV 2007»
13 years 7 months ago
Face Hallucination: Theory and Practice
In this paper, we study face hallucination, or synthesizing a high-resolution face image from an input low-resolution image, with the help of a large collection of other high-reso...
Ce Liu, Heung-Yeung Shum, William T. Freeman
AAAI
2008
13 years 9 months ago
Abduction with Bounded Treewidth: From Theoretical Tractability to Practically Efficient Computation
Abductive diagnosis is an important method to identify explanations for a given set of observations. Unfortunately, most of the algorithmic problems in this area are intractable. ...
Georg Gottlob, Reinhard Pichler, Fang Wei
EDBT
1990
ACM
108views Database» more  EDBT 1990»
13 years 11 months ago
Deductive Databases - Theory Meets Practice
Deductive Databases are coming of age with the emergence of efficient and easy to use systems that support queries, reasoning, and application development on databases through dec...
Carlo Zaniolo
GLOBECOM
2008
IEEE
13 years 7 months ago
On the Impact of Caching for High Performance Packet Classifiers
Hash functions have a space complexity of O(n) and a possible time complexity of O(1). Thus, packet classifiers exploit hashing to achieve packet classification in wire speed. Esp...
Harald Widiger, Andreas Tockhorn, Dirk Timmermann
ICONIP
2008
13 years 9 months ago
Improvement of Practical Recurrent Learning Method and Application to a Pattern Classification Task
Practical Recurrent Learning (PRL) has been proposed as a simple learning algorithm for recurrent neural networks[1][2]. This algorithm enables learning with practical order O(n2 )...
Mohamad Faizal Bin Samsudin, Katsunari Shibata