Sciweavers

653 search results - page 96 / 131
» The size of minimum 3-trees
Sort
View
ICALP
2007
Springer
15 years 6 months ago
An Optimal Decomposition Algorithm for Tree Edit Distance
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
Erik D. Demaine, Shay Mozes, Benjamin Rossman, Ore...
WEBI
2007
Springer
15 years 6 months ago
PSSF: A Novel Statistical Approach for Personalized Service-side Spam Filtering
The volume of spam e-mails has grown rapidly in the last two years resulting in increasing costs to users, network operators, and e-mail service providers (ESPs). E-mail users dem...
Khurum Nazir Junejo, Asim Karim
BROADNETS
2006
IEEE
15 years 5 months ago
Graded Channel Reservation with Path Switching in Ultra High Capacity Networks
— We introduce a new algorithmic framework for advanced channel reservation in ultra high speed networks, called Graded Channel Reservation (GCR). GCR allows users to specify min...
Reuven Cohen, Niloofar Fazlollahi, David Starobins...
DATE
2006
IEEE
82views Hardware» more  DATE 2006»
15 years 5 months ago
Power-aware compilation for embedded processors with dynamic voltage scaling and adaptive body biasing capabilities
Traditionally, active power has been the primary source of power dissipation in CMOS designs. Although, leakage power is becoming increasingly more important as technology feature...
Po-Kuan Huang, Soheil Ghiasi
ETFA
2006
IEEE
15 years 5 months ago
Wake on LAN over Internet as Web Service
In this paper we present an approach based on the use of embedded network devices for the deployment of small network services, such as DHCP, BOOTP, filters or very specific proxi...
Juan Antonio Gil-Martínez-Abarca, Francisco...