51 search results - page 10 / 11 » Implementation of a Swap Matching Algorithm Using a Graph Th... |
136
Voted
MOBIHOC
2007
ACM
16 years 1 months ago
2007
ACM
A number of studies have shown the abundance of unused spectrum in the TV bands. This is in stark contrast to the overcrowding of wireless devices in the ISM bands. A recent trend...
142
click to vote
FASE
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. This paper presents the use of a method – and its corresponding tool set – for compositional verification of applet interactions on a realistic industrial smart card...
113
Voted
ATVA
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
139
click to vote
EC
1998
15 years 1 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
131
Voted
EUROSYS
2006
ACM
15 years 11 months ago
2006
ACM
Building content-based search tools for feature-rich data has been a challenging problem because feature-rich data such as audio recordings, digital images, and sensor data are in...