Sciweavers

736 search results - page 62 / 148
» High-order functions and their ordering relations
Sort
View
ISPASS
2005
IEEE
15 years 5 months ago
Analysis of Network Processing Workloads
Abstract— Network processing is becoming an increasingly important paradigm as the Internet moves towards an architecture with more complex functionality inside the network. Mode...
Ramaswamy Ramaswamy, Ning Weng, Tilman Wolf
ICIP
2005
IEEE
16 years 1 months ago
Hexagonal versus orthogonal lattices: a new comparison using approximation theory
We provide a new comparison between hexagonal and orthogonal lattices, based on approximation theory. For each of the lattices, we select the "natural" spline basis func...
Laurent Condat, Dimitri Van De Ville, Thierry Blu
AAECC
2007
Springer
148views Algorithms» more  AAECC 2007»
14 years 12 months ago
Enhancing dependency pair method using strong computability in simply-typed term rewriting
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
Keiichirou Kusakari, Masahiko Sakai
BMCBI
2006
166views more  BMCBI 2006»
14 years 12 months ago
Extraction of phylogenetic network modules from the metabolic network
Background: In bio-systems, genes, proteins and compounds are related to each other, thus forming complex networks. Although each organism has its individual network, some organis...
Takuji Yamada, Minoru Kanehisa, Susumu Goto
ICML
2006
IEEE
16 years 20 days ago
Autonomous shaping: knowledge transfer in reinforcement learning
We introduce the use of learned shaping rewards in reinforcement learning tasks, where an agent uses prior experience on a sequence of tasks to learn a portable predictor that est...
George Konidaris, Andrew G. Barto