1696 search results - page 184 / 340 » Permuted function matching |
SPIESR
1997
15 years 13 days ago
1997
This paper presents a formal framework for designing search algorithms which can identify target images by the spatial distribution of color, edge and texture attributes. The fram...
APLAS
2010
ACM
14 years 11 months ago
2010
ACM
This paper studies the problem of statically determining upper bounds on the resource consumption of first-order functional programs. A previous work approached the problem with an...
100
Voted
CORR
2006
Springer
14 years 11 months ago
2006
Springer
In a previous paper [16], the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static an...
IPL
2007
14 years 11 months ago
2007
We study the circuit complexity of the powering function, defined as POWm(Z) = Zm for an n-bit integer input Z and an integer exponent m poly(n). Let LTd denote the class of func...
91
Voted
CN
2002
14 years 11 months ago
2002
We present an approach to building multicast services at the network layer using unicast forwarding and two additional building blocks: (i) ephemeral state probes, i.e. extremely l...